Komplementer gráf (Hungarian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Komplementer gráf" in Hungarian language version.

refsWebsite

Global rank Hungarian rank

2^nd place

8^th place

2,117^th place

5,457^th place

low place

741^st place

1,451^st place

diestel-graph-theory.com

Diestel, Reinhard (2005), Graph Theory (3rd ed.), Springer, ISBN 3-540-26182-6. Electronic edition, page 4.

Lovász, László (1972a), "Normal hypergraphs and the perfect graph conjecture", Discrete Mathematics 2 (3): 253–267, DOI 10.1016/0012-365X(72)90006-4.
Corneil, D. G.; Lerchs, H. & Stewart Burlingham, L. (1981), "Complement reducible graphs", Discrete Applied Mathematics 3 (3): 163–174, DOI 10.1016/0166-218X(81)90013-5.
Golumbic, Martin Charles & Jamison, Robert E. (2006), "Rank-tolerance graph classes", Journal of Graph Theory 52 (4): 317–340, DOI 10.1002/jgt.20163.
Ito, Hiro & Yokoyama, Mitsuo (1998), "Linear time algorithms for graph search and connectivity determination on complement graphs", Information Processing Letters 66 (4): 209–213, DOI 10.1016/S0020-0190(98)00071-4.
Kao, Ming-Yang; Occhiogrosso, Neill & Teng, Shang-Hua (1999), "Simple and efficient graph compression schemes for dense and complement graphs", Journal of Combinatorial Optimization 2 (4): 351–359, DOI 10.1023/A:1009720402326.

Chudnovsky, Maria & Seymour, Paul (2005), "The structure of claw-free graphs", Surveys in combinatorics 2005, vol. 327, London Math. Soc. Lecture Note Ser., Cambridge: Cambridge Univ. Press, pp. 153–171.