Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Critical graph
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==References== {{commons category}} {{reflist|refs= <ref name=brooks>{{citation|doi=10.1017/S030500410002168X|last1=Brooks|first1=R. L.|journal=Proceedings of the Cambridge Philosophical Society|pages=194–197|issue=2|title=On colouring the nodes of a network|volume=37|year=1941|bibcode=1941PCPS...37..194B |s2cid=209835194 }}</ref> <ref name=dbe>{{citation|last1=de Bruijn|first1=N. G.|author1-link=Nicolaas Govert de Bruijn|last2=Erdős|first2=P.|author2-link=Paul Erdős|journal=Nederl. Akad. Wetensch. Proc. Ser. A|pages=371–373|title=A colour problem for infinite graphs and a problem in the theory of relations|volume=54|year=1951|doi=10.1016/S1385-7258(51)50053-7|url=https://research.tue.nl/nl/publications/a-colour-problem-for-infinite-graphs-and-a-problem-in-the-theory-of-relations(8bb2b225-bd1a-4924-97ee-0eefca35f01b).html|citeseerx=10.1.1.210.6623}}. ([[Indagationes Mathematicae|''Indag. Math.'']] '''13'''.)</ref> <ref name=dirac>{{citation|doi=10.1112/plms/s3-7.1.161|last=Dirac|first=G. A.|author-link=Gabriel Andrew Dirac|journal=Proceedings of the London Mathematical Society|pages=161–195|title=A theorem of R. L. Brooks and a conjecture of H. Hadwiger|issue=1|volume=7|year=1957}}</ref> <ref name=erdos>{{citation|last=Erdős|first=Paul|author-link=Paul Erdős|contribution=Problem 2|page=361|publisher=Proc. Colloq., Tihany|title=In Theory of Graphs|year=1967}}</ref> <ref name=gallai-1>{{citation|last=Gallai|first=T.|author-link=Tibor Gallai|journal=Publ. Math. Inst. Hungar. Acad. Sci.|pages=165–192|title=Kritische Graphen I|volume=8|year=1963|ref=none}}</ref> <ref name=gallai-2>{{citation|last=Gallai|first=T.|author-link=Tibor Gallai|journal=Publ. Math. Inst. Hungar. Acad. Sci.|pages=373–395|title=Kritische Graphen II|volume=8|year=1963|ref=none}}</ref> <ref name=hajos>{{citation|last=Hajós|first=G.|author-link=György Hajós|title=Über eine Konstruktion nicht {{mvar|n}}-färbbarer Graphen|journal=Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe|volume=10|pages=116–117|year=1961}} <!-- Might be in: Bericht 1951-1966: Gesamtregister der Jahrgänge I-XV: Wissenschaftliche Zeitschrift der Martin-Luther-Universität Halle-Wittenberg. Germany: n.p., 1969. {{GBurl|aqxDAAAAMAAJ}} oclc 578119357 --></ref> <ref name=lovasz>{{citation|last=Lovász|first=László|author-link=László Lovász|contribution=Solution to Exercise 9.21|publisher=North-Holland|title=Combinatorial Problems and Exercises |edition=2nd |year=1992 |isbn=978-0-8218-6947-5 }}</ref> <ref name=stehlik>{{citation|last=Stehlík|first=Matěj|doi=10.1016/S0095-8956(03)00069-8|issue=2|journal=[[Journal of Combinatorial Theory]]|mr=2017723|pages=189–194|series=Series B|title=Critical graphs with connected complements|volume=89|year=2003|doi-access=}}</ref> }}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)