Backbone coloring for graphs with large girths
From MaRDI portal
Publication:385734
DOI10.1016/J.DISC.2013.05.004zbMath1277.05058OpenAlexW2094405744MaRDI QIDQ385734
Daphne Der-Fen Liu, Xuding Zhu, Yuehua Bu
Publication date: 3 December 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.05.004
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (2)
List backbone colouring of graphs ⋮ Backbone coloring of planar graphs for \(C_8\)-free or \(C_9\)-free
Cites Work
- Unnamed Item
- Backbone colorings of graphs with bounded degree
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
- Relating path coverings to vertex labellings with a condition at distance two
- On \(L(d,1)\)-labelings of graphs
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles
- \(L(2,1)\)-labelings of Cartesian products of two cycles
- Labeling Products of Complete Graphs with a Condition at Distance Two
- Backbone colorings for graphs: Tree and path backbones
- Backbone Colorings and Generalized Mycielski Graphs
- Labelling Graphs with a Condition at Distance 2
- Graph labeling and radio channel assignment
- Labeling Chordal Graphs: Distance Two Condition
- A Theorem about the Channel Assignment Problem
- On the $\lambda$-Number of $Q_n $ and Related Graphs
- The $L(2,1)$-Labeling Problem on Graphs
- Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number
- Circular Distance Two Labeling and the $\lambda$-Number for Outerplanar Graphs
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: Backbone coloring for graphs with large girths
