Backbone coloring of planar graphs for \(C_8\)-free or \(C_9\)-free

DOI10.1016/j.tcs.2015.02.026zbMath1311.05059OpenAlexW2020122951MaRDI QIDQ2344770

Yuehua Bu, Xudong Bao

Publication date: 18 May 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.02.026

zbMATH Keywords

cyclespanning treeplanar graphbackbone coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Backbone colourings of graphs ⋮ On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring

Cites Work

• Unnamed Item
• Unnamed Item
• Backbone coloring for graphs with large girths
• On backbone coloring of graphs
• Backbone coloring of planar graphs without special circles
• Backbone colorings of graphs with bounded degree
• \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
• Backbone colorings for graphs: Tree and path backbones
• 没有4- 圈的平面图的BB- 染色
• Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number

This page was built for publication: Backbone coloring of planar graphs for \(C_8\)-free or \(C_9\)-free