The vertex linear arboricity of distance graphs

DOI10.1016/j.disc.2005.12.001zbMath1087.05019OpenAlexW2167596906MaRDI QIDQ819822

Jiazhuang Liu, Jian Liang Wu, Lian-Cui Zuo

Publication date: 29 March 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.001

zbMATH Keywords

path coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (1)

Vertex arboricity of integer distance graph \(G(D_{m,k})\)

Cites Work

• Unnamed Item
• Unnamed Item
• Colouring the real line
• Colouring prime distance graphs
• Distance graphs and \(T\)-coloring
• Chromatic number of prime distance graphs
• Coloring of integer distance graphs
• On the linear vertex-arboricity of a planar graph
• Bounds for the vertex linear arboricity
• Path chromatic numbers of graphs
• Acyclic colorings of planar graphs
• Chromatic numbers of integer distance graphs

This page was built for publication: The vertex linear arboricity of distance graphs