Hadwiger's Conjecture seems difficult to attack, even in the very special case of graphs G of independence number α(G) = 2. We present some results in this special case.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1206,
author = {Michael D. Plummer and Michael Stiebitz and Bjarne Toft},
title = {On a special case of Hadwiger's conjecture},
journal = {Discussiones Mathematicae Graph Theory},
volume = {23},
year = {2003},
pages = {333-363},
zbl = {1053.05052},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1206}
}
Michael D. Plummer; Michael Stiebitz; Bjarne Toft. On a special case of Hadwiger's conjecture. Discussiones Mathematicae Graph Theory, Tome 23 (2003) pp. 333-363. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1206/
[000] [1] C. Berge, Alternating chain methods: a survey, in: Graph Theory and Computing, ed., R. Read (Academic Press, New York, 1972) 1-13. | Zbl 0245.05115
[001] [2] S. Brandt, On the structure of dense triangle-free graphs, Combin. Prob. Comput. 8 (1999) 237-245, doi: 10.1017/S0963548399003831. | Zbl 0942.05032
[002] [3] S. Brandt and T. Pisanski, Another infinite sequence of dense triangle-free graphs, Elect. J. Combin. 5 (1998) #R43 1-5. | Zbl 0898.05067
[003] [4] P.A. Catlin, Hajós' graph-coloring conjecture: variations and counterexamples, J. Combin. Theory (B) 26 (1979) 268-274, doi: 10.1016/0095-8956(79)90062-5. | Zbl 0385.05033
[004] [5] G.A. Dirac, Some theorems on abstract graphs, Proc. London Math. Soc. 2 (1952) 69-81, doi: 10.1112/plms/s3-2.1.69. | Zbl 0047.17001
[005] [6] G.A. Dirac, Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem, J. Reine Angew. Math. 204 (1960) 116-131, doi: 10.1515/crll.1960.204.116.
[006] [7] P. Duchet and H. Meyniel, On Hadwiger's number and the stability number, Ann. Discrete Math. 13 (1982), 71-74. | Zbl 0522.05060
[007] [8] T. Gallai, Kritische Graphen II, Publ. Math. Inst. Hung. Acad. 8 (1963) 373-395.
[008] [9] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman and Company, San Francisco, 1979). | Zbl 0411.68039
[009] [10] H. Hadwiger, Über eine Klassifikation der Streckenkomplexe, Vierteljahrsschrift der Naturf. Gesellschaft in Zürich 88 (1943) 133-142. | Zbl 0061.41308
[010] [11] J.H. Kim, The Ramsey number R(3,t) has order of magnitude t²/log t, Random Struct. Algorithms 7 (1995) 173-207, doi: 10.1002/rsa.3240070302. | Zbl 0832.05084
[011] [12] U. Krusenstjerna-Hafstrø m and B. Toft, Some remarks on Hadwiger's Conjecture and its relation to a conjecture of Lovász, in: The Theory and Applications of Graphs: Proceedings of the Fourth International Graph Theory Conference, Kalamazoo, 1980, eds., G. Chartrand, Y. Alavi, D.L. Goldsmith, L. Leśniak-Foster and D.R. Lick (John Wiley and Sons, 1981) 449-459.
[012] [13] L. Lovász and M.D. Plummer, Matching Theory, Akadémiai Kiadó, Budapest and Ann. Discrete Math. 29 (North-Holland, Amsterdam, 1986) 448.
[013] [14] W. Mader, Über trennende Eckenmengen in homomorphiekritischen Graphen, Math. Ann. 175 (1968) 243-252, doi: 10.1007/BF02052726. | Zbl 0171.22406
[014] [15] J. Pach, Graphs whose every independent set has a common neighbor, Discrete Math. 37 (1981) 217-228, doi: 10.1016/0012-365X(81)90221-1. | Zbl 0473.05054
[015] [16] N. Robertson, P.D. Seymour and R. Thomas, Hadwiger's conjecture for K₆-free graphs, Combinatorica 13 (1993) 279-362, doi: 10.1007/BF01202354. | Zbl 0830.05028
[016] [17] B. Toft, On separating sets of edges in contraction-critical graphs, Math. Ann. 196 (1972) 129-147, doi: 10.1007/BF01419610. | Zbl 0219.05059
[017] [18] B. Toft, A survey of Hadwiger's Conjecture, Congr. Numer. 115 (1996) 249-283. | Zbl 0895.05025