Flexible list colorings in graphs with special degeneracy conditions

DOI10.1002/jgt.22849zbMath1522.05097arXiv2006.15837OpenAlexW3037312983MaRDI QIDQ6046649

No author found.

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.15837

zbMATH Keywords

degeneracyflexibilitychoosabilitylist coloring

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

On weak flexibility in planar graphs

Cites Work

• Unnamed Item
• Improved bounds for spanning trees with many leaves
• Precoloring extension. I: Interval graphs
• A note on planar 5-list colouring: Non-extendability at distance 4
• Flexibility of planar graphs -- sharpening the tools to get lists of size four
• A refinement of choosability of graphs
• On \(t\)-common list-colorings
• On a spanning tree with specified leaves
• Precoloring extension on unit interval graphs
• Graph Theory
• Spanning trees with many leaves in cubic graphs
• Treewidth: Characterizations, Applications, and Computations
• Precoloring Extension III: Classes of Perfect Graphs
• Flexibility of planar graphs of girth at least six
• List coloring with requests
• On chromatic number of graphs and set-systems
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• Flexibility of triangle‐free planar graphs