Backbone coloring for graphs with large girths

DOI10.1016/J.DISC.2013.05.004MaRDI QIDQ385734zbMATH OpenOpenAlexFDO

Authors Yuehua Bu, Daphne Der-Fen Liu, Xuding Zhu

Publication date 3 December 2013

Published in Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

spanning treelarge girth\(L(21)\)-labelingbackbone coloring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• On backbone coloring of graphs
• Backbone colourings of graphs
• Backbone colorings of graphs with bounded degree
• Backbone colorings for graphs: Tree and path backbones
• Backbone coloring of graphs with galaxy backbones
• Backbone coloring of graphs with galaxy backbones
• The backbone coloring problem for bipartite backbones
• Backbone coloring for triangle-free planar graphs
• Backbone colorings and generalized Mycielski graphs
• Backbone colouring: tree backbones with small diameter in planar graphs

Cites work

• scientific article; zbMATH DE number 881282 (Why is no real title available?)
• A Theorem about the Channel Assignment Problem
• Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number
• Backbone colorings and generalized Mycielski graphs
• Backbone colorings for graphs: Tree and path backbones
• Backbone colorings for networks.
• Backbone colorings of graphs with bounded degree
• Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs
• Graph labeling and radio channel assignment
• Labeling Chordal Graphs: Distance Two Condition
• Labeling products of complete graphs with a condition at distance two
• Labelling Graphs with a Condition at Distance 2
• On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
• On \(L(d,1)\)-labelings of graphs
• On the $\lambda$-Number of $Q_n $ and Related Graphs
• Relating path coverings to vertex labellings with a condition at distance two
• The $L(2,1)$-Labeling Problem on Graphs
• \(L(2,1)\)-labelings of Cartesian products of two cycles
• \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings

Cited in

(10)

• Backbone colorings for graphs: Tree and path backbones
• On the existence of tree backbones that realize the chromatic number on a backbone coloring
• Steinberg-like theorems for backbone colouring
• Backbone coloring of planar graphs for \(C_8\)-free or \(C_9\)-free
• Backbone colourings of graphs
• Backbone colorings and generalized Mycielski graphs
• The computational complexity of the backbone coloring problem for planar graphs with connected backbones
• Backbone colorings of graphs with bounded degree
• Backbone coloring for \(C_5\)-free planar graphs
• List backbone colouring of graphs

This page was built for publication: Backbone coloring for graphs with large girths

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