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

DOI10.1016/j.jctb.2005.04.001zbMath1080.05074MaRDI 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 number; connected matching

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

05C83: Graph minors

Related Items

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

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