Coloring hypergraphs with excluded minors

DOI10.1016/j.ejc.2024.103971zbMATH Open1543.05061MaRDI QIDQ6568846

Raphael Steiner

Publication date: 8 July 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

chromatic numberHadwiger conjecturegraph minors

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Decomposable and indecomposable critical hypergraphs
• On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs
• Linked graphs with restricted lengths
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Fractional colouring and Hadwiger's conjecture
• Hypertree-depth and minors in hypergraphs
• A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two
• A special case of Hadwiger's conjecture
• Packing seagulls
• On the odd-minor variant of Hadwiger's conjecture
• Colour-critical graphs and hypergraphs
• The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs
• Minors, Embeddability, and Extremal Problems for Hypergraphs
• Higher minors and van Kampen's obstruction
• On Hadwiger's Number and the Stability Number
• Connected matchings and Hadwiger's conjecture
• On a special case of Hadwiger's conjecture
• Strong complete minors in digraphs
• Complete directed minors and chromatic number
• Subgraphs of large connectivity and chromatic number

This page was built for publication: Coloring hypergraphs with excluded minors