Flexible List Colorings in Graphs with Special Degeneracy Conditions

DOI10.4230/lipics.isaac.2020.31OpenAlexW3115176827MaRDI QIDQ6065433

No author found.

Publication date: 14 November 2023

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

zbMATH Keywords

degeneracyflexibilitychoosabilitylist coloring

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Robust Connectivity of Graphs on Surfaces

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
• 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

This page was built for publication: Flexible List Colorings in Graphs with Special Degeneracy Conditions