Grötzsch graph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Grötzsch graph" in English language version.

refsWebsite

Global rank English rank

7ams.org

451^st place

277^th place

4doi.org

2^nd place

ams.org

mathscinet.ams.org

Grötzsch (1959). Grötzsch, Herbert (1959), "Zur Theorie der diskreten Gebilde, VII: Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel", Wiss. Z. Martin-Luther-U., Halle-Wittenberg, Math.-Nat. Reihe, 8: 109–120, MR 0116320
Chvátal (1974). Chvátal, Vašek (1974), "The minimality of the Mycielski graph", Graphs and combinatorics (Proc. Capital Conf., George Washington Univ., Washington, D.C., 1973), Berlin: Lecture Notes in Mathematics, Vol. 406, Springer-Verlag, pp. 243–246, MR 0360330
Joyner & Melles (2017). Joyner, W. David; Melles, Caroline Grant (2017), "5.12 Grötzsch graph", Adventures in Graph Theory, Applied and Numerical Harmonic Analysis, Birkhäuser/Springer, Cham, pp. 229–231, doi:10.1007/978-3-319-68383-6, ISBN 978-3-319-68381-2, MR 3753658
Youngs (1996). Youngs, D. A. (1996), "4-chromatic projective graphs", Journal of Graph Theory, 21 (2): 219–227, doi:10.1002/(SICI)1097-0118(199602)21:2<219::AID-JGT12>3.0.CO;2-E, MR 1368748
Galluccio, Goddyn & Hell (2001). Galluccio, Anna; Goddyn, Luis A.; Hell, Pavol (2001), "High-girth graphs avoiding a minor are nearly bipartite", Journal of Combinatorial Theory, Series B, 83 (1): 1–14, doi:10.1006/jctb.2000.2009, MR 1855793
Häggkvist (1981). Häggkvist, R. (1981), "Odd cycles of specified length in nonbipartite graphs", Graph Theory (Cambridge, 1981), pp. 89–99, MR 0671908
Randerath, Schiermeyer & Tewes (2002). Randerath, Bert; Schiermeyer, Ingo; Tewes, Meike (2002), "Three-colourability and forbidden subgraphs. II. Polynomial algorithms", Discrete Mathematics, 251 (1–3): 137–153, doi:10.1016/S0012-365X(01)00335-1, MR 1904597

doi.org

Joyner & Melles (2017). Joyner, W. David; Melles, Caroline Grant (2017), "5.12 Grötzsch graph", Adventures in Graph Theory, Applied and Numerical Harmonic Analysis, Birkhäuser/Springer, Cham, pp. 229–231, doi:10.1007/978-3-319-68383-6, ISBN 978-3-319-68381-2, MR 3753658
Youngs (1996). Youngs, D. A. (1996), "4-chromatic projective graphs", Journal of Graph Theory, 21 (2): 219–227, doi:10.1002/(SICI)1097-0118(199602)21:2<219::AID-JGT12>3.0.CO;2-E, MR 1368748
Galluccio, Goddyn & Hell (2001). Galluccio, Anna; Goddyn, Luis A.; Hell, Pavol (2001), "High-girth graphs avoiding a minor are nearly bipartite", Journal of Combinatorial Theory, Series B, 83 (1): 1–14, doi:10.1006/jctb.2000.2009, MR 1855793
Randerath, Schiermeyer & Tewes (2002). Randerath, Bert; Schiermeyer, Ingo; Tewes, Meike (2002), "Three-colourability and forbidden subgraphs. II. Polynomial algorithms", Discrete Mathematics, 251 (1–3): 137–153, doi:10.1016/S0012-365X(01)00335-1, MR 1904597