Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
DOI10.1016/J.JCTB.2005.04.001zbMATH Open1080.05074OpenAlexW2050035467MaRDI QIDQ2565692FDOQ2565692
Authors: Ken-ichi Kawarabayashi, Michael D. Plummer, Bjarne Toft 
Publication date: 28 September 2005
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2005.04.001
Recommendations
- Large minors in graphs with given independence number
- Hadwiger's conjecture for graphs with forbidden holes
- Independence number and clique minors
- Complete minors and independence number
- THE CLIQUE MINOR OF GRAPHS WITH INDEPENDENCE NUMBER TWO
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
- Independent sets in graphs with an excluded clique minor
- Subcontraction-equivalence and Hadwiger's conjecture
- Unique Colorability and Clique Minors
- An approximate version of Hadwiger's conjecture for claw-free graphs
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)
Cites Work
- Graph Theory and Probability
- On a special case of Hadwiger's conjecture
- The Ramsey number R(3, t) has order of magnitude t2/log t
- On Hadwiger's Number and the Stability Number
- Subcontraction-equivalence and Hadwiger's conjecture
- On a relationship between Hadwiger and stability numbers
- Title not available (Why is that?)
Cited In (17)
- A basic elementary extension of the Duchet-Meyniel theorem
- Complete minors, independent sets, and chordal graphs
- Large immersions in graphs with independence number 3 and 4
- Some remarks on the odd Hadwiger's conjecture
- Multitasking capacity: hardness results and improved constructions
- Biclique immersions in graphs with independence number 2
- Title not available (Why is that?)
- A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two
- Improvements of the five halves theorem of J. Boardman with respect to the decomposability degree
- Packing seagulls
- Clique minors in graphs with a forbidden subgraph
- Clique immersions and independence number
- Independence number and clique minors
- Short proofs of some extremal results. III
- Large minors in graphs with given independence number
- Clique minors in claw-free graphs
- Complete minors and independence number
This page was built for publication: Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565692)
