Contractibility and the Hadwiger Conjecture
Author:
- 1 December 2010
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 31 (8) , 2102-2109
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Linear connectivity forces large complete bipartite minorsJournal of Combinatorial Theory, Series B, 2009
- A Weakening of the Odd Hadwiger's ConjectureCombinatorics, Probability and Computing, 2008
- Another proof of the 5-choosability of -minor-free graphsDiscrete Mathematics, 2008
- A relaxed Hadwiger's Conjecture for list coloringsJournal of Combinatorial Theory, Series B, 2007
- Triangle Density and ContractibilityCombinatorics, Probability and Computing, 2005
- A Survey on Contractible Edges in Graphs of a Prescribed Vertex ConnectivityGraphs and Combinatorics, 2002
- Generalizations of critical connectivity of graphsDiscrete Mathematics, 1988
- Lower bound of the hadwiger number of graphs by their average degreeCombinatorica, 1984
- Eine Eigenschaft der Atome endlicher GraphenArchiv der Mathematik, 1971
- A Property of 4-Chromatic Graphs and some Remarks on Critical GraphsJournal of the London Mathematical Society, 1952