On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring
From MaRDI portal
Publication:4978448
DOI10.1002/jgt.22108zbMath1368.05041arXiv1511.05398OpenAlexW2963591287MaRDI QIDQ4978448
No author found.
Publication date: 10 August 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.05398
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Backbone colouring: tree backbones with small diameter in planar graphs
- On backbone coloring of graphs
- Backbone coloring of planar graphs without special circles
- Backbone coloring of planar graphs for \(C_8\)-free or \(C_9\)-free
- (Circular) backbone colouring: forest backbones in planar graphs
- Backbone colorings for graphs: Tree and path backbones
This page was built for publication: On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring