Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
From MaRDI portal
Publication:6080127
DOI10.1016/j.disc.2023.113668zbMath1525.05051arXiv2203.12248MaRDI QIDQ6080127
Publication date: 30 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.12248
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Density (toughness, etc.) (05C42)
Related Items
Cites Work
- Unnamed Item
- Sparsity. Graphs, structures, and algorithms
- The edge-density for \(K_{2,t}\) minors
- Forcing unbalanced complete bipartite minors
- Dense graphs have \(K_{3,t}\) minors
- Induced matchings in bipartite graphs
- On \(K_{s,t}\)-minors in graphs with given average degree
- Colouring graphs with bounded generalized colouring number
- The strong chromatic index of a cubic graph is at most 10
- A bound on the strong chromatic index of a graph
- Graph minors. XVI: Excluding a non-planar graph
- Strong chromatic index of graphs with maximum degree four
- The square of a planar cubic graph is 7-colorable
- The extremal function for Petersen minors
- On \(K_{s,t}\)-minors in graphs with given average degree. II
- The extremal function for complete minors
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
- Remarks on proper conflict-free colorings of graphs
- Colouring graphs with sparse neighbourhoods: bounds and applications
- The extremal function for noncomplete minors
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- Linear colorings of subcubic graphs
- The extremal function for \(K_{9}\) minors
- On the odd-minor variant of Hadwiger's conjecture
- Homomorphiesätze für Graphen
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- A note on odd colorings of 1-planar graphs
- Conflict-Free Colourings of Graphs and Hypergraphs
- Contractions to k8
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Conflict-Free Coloring of Graphs
- A Stronger Bound for the Strong Chromatic Index
- Induced matchings in cubic graphs
- Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
- Structure of Graphs with Locally Restricted Crossings
- Extremal functions for sparse minors
- Models and solution techniques for frequency assignment problems
- 25 pretty graph colouring problems
- Separating layered treewidth and row treewidth
- On the extremal function for graph minors
