Vertex arboricity of integer distance graph G(D_m,k)

DOI10.1016/J.DISC.2008.03.009zbMATH Open1181.05031OpenAlexW2067443412MaRDI QIDQ1024482FDOQ1024482

Jian-Liang Wu, Qinglin Roger Yu, Liancui Zuo

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

Recommendations

• scientific article
• The vertex linear arboricity of the integer distance graph \(G(D_{m,k,2})\)
• The vertex linear arboricity of an integer distance graph with a special distance set.
• The vertex linear arboricity of a special class of integer distance graphs
• Chromatic numbers of integer distance graphs

zbMATH Keywords

vertex arboricitytree coloringinteger distance graph

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cites Work

• Critical Point-Arboritic Graphs
• Distance graphs and \(T\)-coloring
• Colouring the real line
• Chromatic numbers of integer distance graphs
• Chromatic number of prime distance graphs
• On the critical point-arboricity graphs
• Vertex arboricity and maximum degree
• Coloring of integer distance graphs
• Title not available (Why is that?)
• The vertex linear arboricity of an integer distance graph with a special distance set.
• The vertex linear arboricity of distance graphs
• Vertex partitions of \(K_{4,4}\)-minor free graphs
• Tree coloring of distance graphs with a real interval set

Cited In (6)

• The vertex linear arboricity of distance graphs
• The vertex linear arboricity of an integer distance graph with a special distance set.
• Title not available (Why is that?)
• Circular vertex arboricity
• The vertex linear arboricity of the integer distance graph \(G(D_{m,k,2})\)
• Tree coloring of distance graphs with a real interval set

This page was built for publication: Vertex arboricity of integer distance graph \(G(D_{m,k})\)

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