k-forested coloring of sparse graphs

zbMATH Open1249.05155MaRDI QIDQ2886271FDOQ2886271

Authors: Xin Zhang, Lan Xu, Guizhen Liu 

Publication date: 1 June 2012

Published in: Journal of Shandong University. Natural Science (Search for Journal in Brave)

Recommendations

• \((k,1)\)-coloring of sparse graphs
• \((k,j)\)-coloring of sparse graphs
• \(k\)-forested coloring of planar graphs with large girth
• \(k\)-forested choosability of planar graphs and sparse graphs
• On coloring of sparse graphs
• A Complexity Dichotomy for the Coloring of Sparse Graphs
• An f-chromatic spanning forest of edge-colored complete bipartite graphs
• \((g,f)\)-chromatic spanning trees and forests
• Spanning \(k\)-forests with large components in \(K_{1,k+1}\)-free graphs
• A generalization of heterochromatic graphs and \(f\)-chromatic spanning forests

zbMATH Keywords

sparse graphsmaximum average degree\(k\)-forested coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Cited In (2)

• \(k\)-forested coloring of planar graphs with large girth
• Decomposition of sparse graphs, with application to game coloring number

This page was built for publication: \(k\)-forested coloring of sparse graphs

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