Backbone coloring of planar graphs without special circles
From MaRDI portal
Publication:650874
DOI10.1016/J.TCS.2011.06.032zbMATH Open1230.05126OpenAlexW2028290377MaRDI QIDQ650874FDOQ650874
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.06.032
Recommendations
Cites Work
- Graph theory
- \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
- Backbone colorings for graphs: Tree and path backbones
- On backbone coloring of graphs
- Backbone coloring for \(C_4\)-free planar graphs
- Backbone colorings along stars and matchings in split graphs: their span is close to the chromatic number
- Backbone colorings for networks.
Cited In (10)
- Backbone coloring for \(C_5\)-free planar graphs
- On the existence of tree backbones that realize the chromatic number on a backbone coloring
- Backbone coloring of planar graphs for \(C_8\)-free or \(C_9\)-free
- Title not available (Why is that?)
- Circular backbone colorings: on matching and tree backbones of planar graphs
- Backbone coloring for \(C_4\)-free planar graphs
- Backbone coloring for triangle-free planar graphs
- Backbone colourings of graphs
- The backbone coloring of planar graphs without 7-cycles
- Backbone colouring: tree backbones with small diameter in planar graphs
This page was built for publication: Backbone coloring of planar graphs without special circles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650874)