The vertex linear arboricity of an integer distance graph with a special distance set.

MaRDI QIDQ3428634zbMATH OpenFDO

Authors Jiazhuang Liu, Liancui Zuo, Jian-Liang Wu

Publication date 29 March 2007

zbMATH Keywords

path coloringvertex linear arboricityinteger distance graph

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Other combinatorial number theory (11B75)

Recommendations

• The vertex linear arboricity of a special class of integer distance graphs
• The vertex linear arboricity of the integer distance graph \(G(D_{m,k,2})\)
• The vertex linear arboricity of distance graphs
• scientific article; zbMATH DE number 5926622
• Vertex arboricity of integer distance graph \(G(D_{m,k})\)

Cited in

(7)

• The vertex linear arboricity of distance graphs
• The vertex linear arboricity of a special class of integer distance graphs
• scientific article; zbMATH DE number 5926622 (Why is no real title available?)
• Vertex arboricity of integer distance graph \(G(D_{m,k})\)
• The vertex linear arboricity of the integer distance graph \(G(D_{m,k,2})\)
• Tree coloring of distance graphs with a real interval set
• The fractional vertex linear arboricity of graphs.

This page was built for publication: The vertex linear arboricity of an integer distance graph with a special distance set.

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