Steinberg-like theorems for backbone colouring

DOI10.1016/J.DAM.2017.03.009zbMath1387.05080OpenAlexW2606486936MaRDI QIDQ5916058

No author found.

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01796713/file/backbone-steinberg.pdf

zbMATH Keywords

graph colouringplanar graphbackbone colouringSteinberg's conjecture

Mathematics Subject Classification ID

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

Related Items (1)

Backbone coloring of graphs with galaxy backbones

Cites Work

• Steinberg's conjecture is false
• Backbone colouring: tree backbones with small diameter in planar graphs
• (Circular) backbone colouring: forest backbones in planar graphs
• Backbone colorings for graphs: Tree and path backbones
• Every Planar Map is Four Colorable
• Unnamed Item
• Unnamed Item

This page was built for publication: Steinberg-like theorems for backbone colouring