On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs

DOI10.1016/J.DISC.2010.04.005zbMath1215.05070OpenAlexW2049813670WikidataQ123017470 ScholiaQ123017470MaRDI QIDQ709320

Matthias Kriesell

Publication date: 18 October 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.04.005

zbMATH Keywords

complete minorHadwiger's conjectureforbidden induced subgraphconnected dominating matching

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Related Items (3)

Hadwiger's Conjecture for Graphs with Forbidden Holes ⋮ Clique immersions in graphs of independence number two with certain forbidden subgraphs ⋮ A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two

Cites Work

• Unnamed Item
• Unnamed Item
• A special case of Hadwiger's conjecture
• Packing seagulls
• On Representatives of Subsets
• On a special case of Hadwiger's conjecture
• Combinatorial Relations and Chromatic Graphs

This page was built for publication: On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs