The computational complexity of the backbone coloring problem for planar graphs with connected backbones

DOI10.1016/j.dam.2014.10.028zbMath1311.05065OpenAlexW2011585974MaRDI QIDQ2341776

Krzysztof Turowski, Robert Janczewski

Publication date: 28 April 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.10.028

zbMATH Keywords

planar graphscactibackbone chromatic number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• The backbone coloring problem for bipartite backbones
• \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
• Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
• A polynomial algorithm for finding \(T\)-span of generalized cacti
• (Circular) backbone colouring: forest backbones in planar graphs
• Combinatorial Geometry and Graph Theory
• On the Number of Husimi Trees
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: The computational complexity of the backbone coloring problem for planar graphs with connected backbones