Path choosability of planar graphs

zbMath1440.05082MaRDI QIDQ1627209

Chris Hartman, Glenn G. Chappell

Publication date: 22 November 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p33

zbMATH Keywords

graph coloringpath coloringchoosabilitylist coloring

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results on \((a:b)\)-choosability
• The smallest n-uniform hypergraph with positive discrepancy
• Choosability and fractional chromatic numbers
• Defective and clustered graph colouring
• List improper colorings of planar graphs with prescribed girth
• List strong linear 2-arboricity of sparse graphs
• Defective choosability of graphs in surfaces
• On the linear vertex-arboricity of a planar graph
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Path chromatic numbers of graphs
• Graph colorings with local constraints -- a survey
• List Improper Colourings of Planar Graphs
• Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths
• Improper choosability of graphs and maximum average degree
• The Point-Arboricity of Planar Graphs
• Acyclic colorings of planar graphs