Local Hadwiger's conjecture
From MaRDI portal
Publication:6170795
DOI10.1016/j.jctb.2023.05.004zbMath1519.05083arXiv2203.06718MaRDI QIDQ6170795
Lise Turner, Benjamin Moore, Luke Postle
Publication date: 10 August 2023
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.06718
Cites Work
- Unnamed Item
- Unnamed Item
- Disproof of the list Hadwiger conjecture
- Lower bound of the Hadwiger number of graphs by their average degree
- Some recent progress and applications in graph minor theory
- A relaxed Hadwiger's conjecture for list colorings
- Linear connectivity forces large complete bipartite minors
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Fractional colouring and Hadwiger's conjecture
- Choosability of \(K_5\)-minor-free graphs
- Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application.
- Connectivity and choosability of graphs with no \(K_t\) minor
- Progress towards Nash-Williams' conjecture on triangle decompositions
- Distributed coloring in sparse graphs with fewer colors
- Über eine Eigenschaft der ebenen Komplexe
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor
- Graph Theory
- An extremal function for contractions of graphs
- Deterministic coin tossing with applications to optimal parallel list ranking
- Parallel Symmetry-Breaking in Sparse Graphs
- Every Planar Map is Four Colorable
- Hyperbolic families and coloring graphs on surfaces
- 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Improved lower bound for the list chromatic number of graphs with no Kt minor
This page was built for publication: Local Hadwiger's conjecture
