Path choosability of planar graphs

MaRDI QIDQ1627209zbMATH OpenFDO

Authors Glenn G. Chappell, Chris Hartman

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

graph coloringlist coloringchoosabilitypath coloring

Mathematics Subject Classification ID

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

Recommendations

• Choosability of planar graphs
• scientific article; zbMATH DE number 1002024
• The complexity of planar graph choosability
• Minimum choosability of planar graphs
• On the path separability of planar graphs
• The entire choosability of plane graphs
• Choosability in signed planar graphs
• On the path-width of planar graphs
• scientific article; zbMATH DE number 3735847
• On the total choosability of planar graphs and of sparse graphs

Cites work

• scientific article; zbMATH DE number 446487 (Why is no real title available?)
• scientific article; zbMATH DE number 3910413 (Why is no real title available?)
• scientific article; zbMATH DE number 3735847 (Why is no real title available?)
• scientific article; zbMATH DE number 1250667 (Why is no real title available?)
• scientific article; zbMATH DE number 1341914 (Why is no real title available?)
• scientific article; zbMATH DE number 1478494 (Why is no real title available?)
• scientific article; zbMATH DE number 1536522 (Why is no real title available?)
• scientific article; zbMATH DE number 908794 (Why is no real title available?)
• Acyclic colorings of planar graphs
• Choosability and fractional chromatic numbers
• Defective and clustered graph colouring
• Defective choosability of graphs in surfaces
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• Graph colorings with local constraints -- a survey
• Improper choosability of graphs and maximum average degree
• List Improper Colourings of Planar Graphs
• List improper colorings of planar graphs with prescribed girth
• List strong linear 2-arboricity of sparse graphs
• On the linear vertex-arboricity of a planar graph
• Path chromatic numbers of graphs
• Some results on \((a:b)\)-choosability
• Splitting planar graphs of girth 6 into two linear forests with short paths
• The Point-Arboricity of Planar Graphs
• The smallest n-uniform hypergraph with positive discrepancy
• Threshold for path colorings of planar graphs

Cited in

(6)

• Defective choosability results for outerplanar and related graphs
• Threshold for path colorings of planar graphs
• scientific article; zbMATH DE number 4089589 (Why is no real title available?)
• Choosability of planar graphs
• List colouring of graphs and generalized Dyck paths
• Paths of low weight in planar graphs

This page was built for publication: Path choosability of planar graphs

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