scientific article; zbMATH DE number 5926622

MaRDI QIDQ3014907zbMATH OpenFDO

Authors Yuquan Cui, Jiazhuang Liu, Liancui Zuo

Publication date 19 July 2011

zbMATH Keywords

integer distance graphtree coloringvertex arboricity

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Vertex arboricity of integer distance graph \(G(D_{m,k})\)
• The vertex linear arboricity of the integer distance graph \(G(D_{m,k,2})\)
• The vertex linear arboricity of a special class of integer distance graphs
• The vertex linear arboricity of an integer distance graph with a special distance set.
• The vertex linear arboricity of distance graphs
• On the vertex arboricity of planar graphs of diameter two
• scientific article; zbMATH DE number 1334616
• A Note on the Vertex Arboricity of a Graph
• L(2,l)-labellings of integer distance graphs
• On the vertex-arboricity of \(K_5\)-minor-free graphs of diameter 2

Cited in

(5)

• Vertex arboricity of integer distance graph \(G(D_{m,k})\)
• Tree coloring of distance graphs with a real interval set
• The vertex linear arboricity of a special class of integer distance graphs
• The vertex linear arboricity of an integer distance graph with a special distance set.
• The vertex linear arboricity of the integer distance graph \(G(D_{m,k,2})\)

This page was built for publication:

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