Backbone colouring: tree backbones with small diameter in planar graphs

DOI10.1016/J.TCS.2013.03.003zbMath1300.05072OpenAlexW2040962894MaRDI QIDQ387001

Mohammad Hasan, H. S. Yoon

Publication date: 11 December 2013

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

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

zbMATH Keywords

planar graphsbackbone colouringBroersma's conjecture

Mathematics Subject Classification ID

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

Related Items (7)

Circular backbone colorings: on matching and tree backbones of planar graphs ⋮ Backbone colourings of graphs ⋮ Steinberg-like theorems for backbone colouring ⋮ (Circular) backbone colouring: forest backbones in planar graphs ⋮ Steinberg-like theorems for backbone colouring ⋮ Backbone coloring of graphs with galaxy backbones ⋮ On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring

Cites Work

• On backbone coloring of graphs
• Backbone coloring of planar graphs without special circles
• \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
• Backbone colorings for graphs: Tree and path backbones
• Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
• 没有4- 圈的平面图的BB- 染色
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Backbone colouring: tree backbones with small diameter in planar graphs