Immersion and clustered coloring
From MaRDI portal
Publication:2099417
DOI10.1016/j.jctb.2022.07.010zbMath1504.05094arXiv2007.00259OpenAlexW3038387569MaRDI QIDQ2099417
Publication date: 23 November 2022
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.00259
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A minimum degree condition forcing complete graph immersion
- Contractibility and the Hadwiger conjecture
- Lower bound of the Hadwiger number of graphs by their average degree
- A relaxed Hadwiger's conjecture for list colorings
- Hajos' graph-coloring conjecture: Variations and counterexamples
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- The four-colour theorem
- Bounded size components -- partitions and transversals.
- Partitioning into graphs with only small components
- On the conjecture of Hajos
- Layered separators in minor-closed graph classes with applications
- Clustered variants of Hajós' conjecture
- A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor
- Graph Coloring and the Immersion Order
- Immersing small complete graphs
- Graph Theory and Probability
- An extremal function for contractions of graphs
- A Relative of Hadwiger's Conjecture
- Graph coloring with no large monochromatic components
- Complete graph immersions and minimum degree
- Improper colourings inspired by Hadwiger's conjecture
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- The structure of k-chromatic graphs
- Forcing clique immersions through chromatic number
- Partitioning \(H\)-minor free graphs into three subgraphs with no large components
This page was built for publication: Immersion and clustered coloring
