Path chromatic numbers of graphs
From MaRDI portal
Publication:4206745
DOI10.1002/jgt.3190130506zbMath0688.05024OpenAlexW1994739637MaRDI QIDQ4206745
Jin Akiyama, Mamoru Watanabe, Hiroshi Era, Severino V. Gervacio
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
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (11)
The vertex linear arboricity of distance graphs ⋮ Path choosability of planar graphs ⋮ Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday) ⋮ Computational complexity of \((2,2)\) path chromatic number problem ⋮ Maximum induced forests of planar graphs ⋮ On the linear vertex-arboricity of a planar graph ⋮ Drawing Graphs on Few Lines and Few Planes ⋮ On monochromatic component size for improper colourings ⋮ On vertex partitions and some minor-monotone graph parameters ⋮ Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths ⋮ Relaxed chromatic numbers of graphs
This page was built for publication: Path chromatic numbers of graphs
