Path chromatic numbers of graphs

DOI10.1002/JGT.3190130506MaRDI QIDQ4206745zbMATH OpenOpenAlexWikidataFDO

Authors Jin Akiyama, Hiroshi Era, Severino V. Gervacio, Mamoru Watanabe

Publication date 1989

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190130506

zbMATH Keywords

k-path chromatic numberouterplanar graphsplanar graphsregular graphsupper bounds

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 653270
• A colourful path
• On the k-path-chromatic number of complementary graphs
• On path-chromatically unique graphs
• On the chromatic number of path graph P₃(G)

Cited in

(24)

• Maximum induced forests of planar graphs
• Relaxed chromatic numbers of graphs
• Path choosability of planar graphs
• On monochromatic component size for improper colourings
• On the chromatic index of path decompositions
• Paths with two blocks in k-chromatic digraphs
• Computational complexity of (2,2) path chromatic number problem
• On path-chromatically unique graphs
• Locating chromatic number of powers of paths and cycles
• Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
• Drawing Graphs on Few Lines and Few Planes
• On vertex partitions and some minor-monotone graph parameters
• On the k-path-chromatic number of complementary graphs
• On the chromatic number of path graph P₃(G)
• On the linear vertex-arboricity of a planar graph
• scientific article; zbMATH DE number 25879 (Why is no real title available?)
• scientific article; zbMATH DE number 1308944 (Why is no real title available?)
• scientific article; zbMATH DE number 568810 (Why is no real title available?)
• scientific article; zbMATH DE number 653270 (Why is no real title available?)
• Splitting planar graphs of girth 6 into two linear forests with short paths
• Open neighbourhood colouring of some path related graphs
• Bounded colorings of outerplanar graphs
• Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length
• The vertex linear arboricity of distance graphs

This page was built for publication: Path chromatic numbers of graphs

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