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

DOI10.1016/j.disc.2008.03.009zbMath1181.05031OpenAlexW2067443412MaRDI QIDQ1024482

Qinglin Yu, Lian-Cui Zuo, Jian Liang Wu

Publication date: 17 June 2009

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

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

zbMATH Keywords

integer distance graphvertex arboricitytree coloring

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items

Circular vertex arboricity

Cites Work

• Unnamed Item
• Unnamed Item
• Colouring the real line
• The vertex linear arboricity of distance graphs
• Distance graphs and \(T\)-coloring
• Chromatic number of prime distance graphs
• Coloring of integer distance graphs
• Vertex arboricity and maximum degree
• Tree coloring of distance graphs with a real interval set
• On the critical point-arboricity graphs
• Critical Point-Arboritic Graphs
• Chromatic numbers of integer distance graphs
• Vertex partitions of \(K_{4,4}\)-minor free graphs