Backbone coloring of graphs with galaxy backbones

DOI10.1016/j.entcs.2019.08.006OpenAlexW2978587155WikidataQ113317427 ScholiaQ113317427MaRDI QIDQ5918665

No author found.

Publication date: 27 April 2022

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2019.08.006

zbMATH Keywords

graph coloringplanar graphscircular backbone coloringBrooks' type theorem

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Backbone colorings of graphs with bounded degree
• \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
• Circular backbone colorings: on matching and tree backbones of planar graphs
• A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks' theorem
• Fast 3-coloring triangle-free planar graphs
• (Circular) backbone colouring: forest backbones in planar graphs
• Backbone colorings for graphs: Tree and path backbones
• Parameterized Algorithms
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: Backbone coloring of graphs with galaxy backbones