Flexible List Colorings in Graphs with Special Degeneracy Conditions

DOI10.4230/LIPICS.ISAAC.2020.31MaRDI QIDQ6065433zbMATH OpenOpenAlexFDO

Authors

Publication date 14 November 2023

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

zbMATH Keywords

choosabilitydegeneracyflexibilitylist coloring

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• A note on planar 5-list colouring: Non-extendability at distance 4
• A refinement of choosability of graphs
• Flexibility of planar graphs of girth at least six
• Flexibility of triangle‐free planar graphs
• Graph theory
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• Improved bounds for spanning trees with many leaves
• List coloring with requests
• On \(t\)-common list-colorings
• On a spanning tree with specified leaves
• On chromatic number of graphs and set-systems
• Precoloring Extension III: Classes of Perfect Graphs
• Precoloring extension on unit interval graphs
• Precoloring extension. I: Interval graphs
• Spanning trees with many leaves in cubic graphs
• Treewidth: Characterizations, Applications, and Computations

Cited in

(1)

• Robust connectivity of graphs on surfaces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6065433)