گراف‌های پنجه‌آزاد (Persian Wikipedia)

Analysis of information sources in references of the Wikipedia article "گراف‌های پنجه‌آزاد" in Persian language version.

refsWebsite

Global rank Persian rank

2^nd place

7,690^th place

low place

207^th place

287^th place

274^th place

506^th place

doi.org

Kloks, Ton; Kratsch, Dieter; Müller, Haiko (2000). "Finding and counting small induced subgraphs efficiently". Inf. Process. Lett. 74 (3–4): 115–121. doi:10.1016/S0020-0190(00)00047-8.
Chrobak, Marek; Naor, Joseph; Novick, Mark B. (1989). Dehne, F.; Sack, J. -R.; Santoro, N. (eds.). "Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs". Algorithms and Data Structures. Lecture Notes in Computer Science (به انگلیسی). Springer Berlin Heidelberg: 147–162. doi:10.1007/3-540-51542-9_13. ISBN 9783540482376.

Palmer، Edgar M.؛ Read، Ronald C.؛ Robinson، Robert W. (۲۰۰۲). Counting claw-free cubic graphs.

Chrobak, Marek; Naor, Joseph; Novick, Mark B. (1989). Dehne, F.; Sack, J. -R.; Santoro, N. (eds.). "Using bounded degree spanning trees in the design of efficient algorithms on claw-free graphs". Algorithms and Data Structures. Lecture Notes in Computer Science (به انگلیسی). Springer Berlin Heidelberg: 147–162. doi:10.1007/3-540-51542-9_13. ISBN 9783540482376.

Kloks, Ton; Kratsch, Dieter; Müller, Haiko (2000). "Finding and counting small induced subgraphs efficiently". Inf. Process. Lett. 74 (3–4): 115–121. doi:10.1016/S0020-0190(00)00047-8.