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

zbMATH Open1141.05034MaRDI QIDQ3428634FDOQ3428634

Authors: Jiazhuang Liu, Liancui Zuo, Jian-Liang Wu 

Publication date: 29 March 2007

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})\)

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)

Cited In (7)

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

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)