Backbone colourings of graphs

DOI10.1016/J.DISC.2016.05.010zbMATH Open1339.05131OpenAlexW2417722483MaRDI QIDQ2629282FDOQ2629282

Authors: Babak Farzad, Arnoosh Golestanian, Michael Molloy 

Publication date: 5 July 2016

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

Full work available at URL: https://doi.org/10.1016/j.disc.2016.05.010

Recommendations

• On backbone coloring of graphs
• Backbone colorings of graphs with bounded degree
• Backbone colorings for graphs: Tree and path backbones
• Backbone colorings and generalized Mycielski graphs
• Backbone coloring for graphs with large girths
• Backbone coloring of graphs with galaxy backbones
• Backbone coloring of graphs with galaxy backbones
• List backbone colouring of graphs
• The backbone coloring problem for bipartite backbones
• Backbone coloring for triangle-free planar graphs

zbMATH Keywords

chromatic numberspanning treebackbone colouring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Backbone colorings for graphs: Tree and path backbones
• Backbone colouring: tree backbones with small diameter in planar graphs
• Backbone coloring for \(C_4\)-free planar graphs
• Backbone coloring of planar graphs without special circles
• Backbone coloring of planar graphs for \(C_8\)-free or \(C_9\)-free
• Backbone coloring for \(C_5\)-free planar graphs
• Title not available (Why is that?)
• On the existence of tree backbones that realize the chromatic number on a backbone coloring

Cited In (17)

• Backbone coloring of graphs with galaxy backbones
• The \(\lambda\)-backbone colorings of graphs with tree backbones
• Backbone colorings of graphs with bounded degree
• On the existence of tree backbones that realize the chromatic number on a backbone coloring
• The computational complexity of the backbone coloring problem for planar graphs with connected backbones
• Optimal backbone coloring of split graphs with matching backbones
• Backbone colorings and generalized Mycielski graphs
• Backbone colorings for networks.
• Backbone coloring for triangle-free planar graphs
• (Circular) backbone colouring: forest backbones in planar graphs
• Backbone colorings for graphs: Tree and path backbones
• Steinberg-like theorems for backbone colouring
• Backbone coloring for graphs with large girths
• Backbone colouring: tree backbones with small diameter in planar graphs
• On backbone coloring of graphs
• The backbone coloring problem for bipartite backbones
• On list backbone coloring of graphs.

This page was built for publication: Backbone colourings of graphs

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