Coloring hypergraphs with excluded minors
type: Item
instance of: scholarly article
title: Coloring hypergraphs with excluded minors
zbMATH Open document ID: 1543.05061
author: Raphael Steiner
published in: European Journal of Combinatorics
publication date: 2024-07-08T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 7878023
zbMATH Keywords: chromatic number
zbMATH Keywords: graph minors
zbMATH Keywords: Hadwiger conjecture
MaRDI profile type: Publication
cites work: Hypertree-depth and minors in hypergraphs
cites work: The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs
cites work: Strong complete minors in digraphs
cites work: A special case of Hadwiger's conjecture
cites work: A note on Hadwiger's conjecture for \(W_5\)-free graphs with independence number two
cites work: Linked graphs with restricted lengths
cites work: Packing seagulls
cites work: On Hadwiger's Number and the Stability Number
cites work: Connected matchings and Hadwiger's conjecture
cites work: On the odd-minor variant of Hadwiger's conjecture
cites work: Subgraphs of large connectivity and chromatic number
cites work: Q5837979
cites work: On Seymour's strengthening of Hadwiger's conjecture for graphs with certain forbidden subgraphs
cites work: Complete directed minors and chromatic number
cites work: Higher minors and van Kampen's obstruction
cites work: On a special case of Hadwiger's conjecture
cites work: Fractional colouring and Hadwiger's conjecture
cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs
cites work: Decomposable and indecomposable critical hypergraphs
cites work: Colour-critical graphs and hypergraphs
cites work: Minors, Embeddability, and Extremal Problems for Hypergraphs
DOI: 10.1016/J.EJC.2024.103971
description: scientific article; zbMATH DE number 7878023