Choosability with separation of cycles and outerplanar graphs

DOI10.7151/DMGT.2398MaRDI QIDQ6985985zbMATH OpenFDO

Authors Jean-Christophe Godin, Olivier Togni

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2398

zbMATH Keywords

choosabilitycoloringouterplanar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Cites work

• \((4,2)\)-choosability of planar graphs with forbidden structures
• A note on choosability with separation for planar graphs.
• A sufficient condition for planar graphs to be (3,1)-choosable
• Brooks-type theorems for choosability with separation
• Choosability with separation of complete multipartite graphs and hypergraphs
• Choosability with separation of planar graphs without prescribed cycles
• Choosability with union separation
• Complexity of choosing subsets from color sets
• Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable
• Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs
• Free choosability of outerplanar graphs
• On choosability with separation of planar graphs with forbidden cycles
• On choosability with separation of planar graphs with lists of different sizes
• On choosability with separation of planar graphs without adjacent short cycles
• Separation choosability and dense bipartite induced subgraphs

Cited in

(1)

• On list coloring with separation of the complete graph and set system intersections

This page was built for publication: Choosability with separation of cycles and outerplanar graphs

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