Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture

DOI10.1016/j.jctb.2005.04.001zbMath1080.05074OpenAlexW2050035467MaRDI QIDQ2565692

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

zbMATH Keywords

independence numberconnected matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Related Items (9)

Large immersions in graphs with independence number 3 and 4 ⋮ Clique immersions and independence number ⋮ Clique minors in graphs with a forbidden subgraph ⋮ Large minors in graphs with given independence number ⋮ Some remarks on the odd Hadwiger's conjecture ⋮ A basic elementary extension of the Duchet-Meyniel theorem ⋮ Multitasking Capacity: Hardness Results and Improved Constructions ⋮ Short proofs of some extremal results III ⋮ Clique minors in claw-free graphs

Cites Work

• Unnamed Item
• On a relationship between Hadwiger and stability numbers
• Graph Theory and Probability
• On Hadwiger's Number and the Stability Number
• Subcontraction-equivalence and Hadwiger's conjecture
• On a special case of Hadwiger's conjecture
• The Ramsey number R(3, t) has order of magnitude t²/log t

This page was built for publication: Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture