Meyniel graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Meyniel graph" in English language version.

refsWebsite

Global rank English rank

451^st place

277^th place

2^nd place

low place

102^nd place

76^th place

ams.org (Global: 451^st place; English: 277^th place)

Meyniel, H. (1976), "On the perfect graph conjecture", Discrete Mathematics, 16 (4): 339–342, doi:10.1016/S0012-365X(76)80008-8, MR 0439682.
Markosjan, S. E.; Karapetjan, I. A. (1976), "Perfect graphs", Doklady Akademiya Nauk Armyanskoĭ SSR, 63 (5): 292–296, MR 0450130.
Hoàng, C. T. (1987), "On a conjecture of Meyniel", Journal of Combinatorial Theory, Series B, 42 (3): 302–312, doi:10.1016/0095-8956(87)90047-5, MR 0888682.
Burlet, M.; Fonlupt, J. (1984), "Polynomial algorithm to recognize a Meyniel graph", Topics on perfect graphs, North-Holland Math. Stud., vol. 88, North-Holland, Amsterdam, pp. 225–252, doi:10.1016/S0304-0208(08)72938-4, hdl:10068/49205, ISBN 978-0-444-86587-8, MR 0778765.
Hertz, A. (1990), "A fast algorithm for coloring Meyniel graphs", Journal of Combinatorial Theory, Series B, 50 (2): 231–240, doi:10.1016/0095-8956(90)90078-E, MR 1081227.
Roussel, F.; Rusu, I. (2001), "An $O (n 2)$ algorithm to color Meyniel graphs", Discrete Mathematics, 235 (1–3): 107–123, doi:10.1016/S0012-365X(00)00264-8, MR 1829840.

Meyniel, H. (1976), "On the perfect graph conjecture", Discrete Mathematics, 16 (4): 339–342, doi:10.1016/S0012-365X(76)80008-8, MR 0439682.
Hoàng, C. T. (1987), "On a conjecture of Meyniel", Journal of Combinatorial Theory, Series B, 42 (3): 302–312, doi:10.1016/0095-8956(87)90047-5, MR 0888682.
Burlet, M.; Fonlupt, J. (1984), "Polynomial algorithm to recognize a Meyniel graph", Topics on perfect graphs, North-Holland Math. Stud., vol. 88, North-Holland, Amsterdam, pp. 225–252, doi:10.1016/S0304-0208(08)72938-4, hdl:10068/49205, ISBN 978-0-444-86587-8, MR 0778765.
Hertz, A. (1990), "A fast algorithm for coloring Meyniel graphs", Journal of Combinatorial Theory, Series B, 50 (2): 231–240, doi:10.1016/0095-8956(90)90078-E, MR 1081227.
Roussel, F.; Rusu, I. (2001), "An $O (n 2)$ algorithm to color Meyniel graphs", Discrete Mathematics, 235 (1–3): 107–123, doi:10.1016/S0012-365X(00)00264-8, MR 1829840.

Meyniel graphs, Information System on Graph Classes and their Inclusions, retrieved 2016-09-25.

Burlet, M.; Fonlupt, J. (1984), "Polynomial algorithm to recognize a Meyniel graph", Topics on perfect graphs, North-Holland Math. Stud., vol. 88, North-Holland, Amsterdam, pp. 225–252, doi:10.1016/S0304-0208(08)72938-4, hdl:10068/49205, ISBN 978-0-444-86587-8, MR 0778765.