Backbone colouring: tree backbones with small diameter in planar graphs
From MaRDI portal
Recommendations
Cites work
- Backbone coloring for \(C_4\)-free planar graphs
- Backbone coloring of planar graphs without special circles
- Backbone colorings for graphs: Tree and path backbones
- Backbone colorings for networks.
- Efficient Vertex- and Edge-Coloring of Outerplanar Graphs
- On backbone coloring of graphs
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
Cited in
(13)- 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
- Steinberg-like theorems for backbone colouring
- Circular backbone colorings: on matching and tree backbones of planar graphs
- Backbone coloring of graphs with galaxy backbones
- Backbone colourings of graphs
- scientific article; zbMATH DE number 6178933 (Why is no real title available?)
- Backbone coloring for graphs with large girths
- Backbone colorings and generalized Mycielski graphs
- The computational complexity of the backbone coloring problem for planar graphs with connected backbones
- Backbone coloring for triangle-free planar graphs
- (Circular) backbone colouring: forest backbones in planar graphs
This page was built for publication: Backbone colouring: tree backbones with small diameter in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q387001)