Backbone coloring for graphs with large girths
From MaRDI portal
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)