Path chromatic numbers of graphs
From MaRDI portal
Publication:4206745
DOI10.1002/jgt.3190130506zbMath0688.05024MaRDI QIDQ4206745
Hiroshi Era, Severino V. Gervacio, Jin Akiyama, 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
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
The vertex linear arboricity of distance graphs, Maximum induced forests of planar graphs, Relaxed chromatic numbers of graphs, On monochromatic component size for improper colourings, Computational complexity of \((2,2)\) path chromatic number problem, Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday), On vertex partitions and some minor-monotone graph parameters, On the linear vertex-arboricity of a planar graph