Flexibility of triangle‐free planar graphs
From MaRDI portal
Publication:6055413
DOI10.1002/jgt.22634zbMath1521.05033OpenAlexW2914534083MaRDI QIDQ6055413
Zdeněk Dvořák, Ondřej Pangrác, Jan Musílek, Tomáš Masařík
Publication date: 29 September 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22634
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Flexible list colorings in graphs with special degeneracy conditions ⋮ Flexibility of planar graphs -- sharpening the tools to get lists of size four ⋮ Flexible List Colorings in Graphs with Special Degeneracy Conditions
Cites Work
- 5-list-coloring planar graphs with distant precolored vertices
- List colourings of planar graphs
- The complexity of completing partial Latin squares
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- The non-existence of colorings
- You can't paint yourself into a corner
- Five-coloring maps on surfaces
- Every planar graph is 5-choosable
- A short list color proof of Grötzsch's theorem
- A not 3-choosable planar graph without 3-cycles
- Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm
- NP completeness of the edge precoloring extension problem on bipartite graphs
- Exponentially many 4‐list‐colorings of triangle‐free graphs on surfaces
- List coloring with requests
- Fine Structure of 4-Critical Triangle-Free Graphs II. Planar Triangle-Free Graphs with Two Precolored 4-Cycles
This page was built for publication: Flexibility of triangle‐free planar graphs
