The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones

DOI10.1016/J.IPL.2014.09.018zbMATH Open1304.05045OpenAlexW2045373821MaRDI QIDQ477637FDOQ477637

Authors: R. Janczewski, Krzysztof Turowski 

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.018

Recommendations

• The computational complexity of the backbone coloring problem for planar graphs with connected backbones
• The computational complexity of \(\lambda\)-backbone colorings of graphs with \(n\)-complete backbones
• Backbone colorings for graphs: Tree and path backbones
• Backbone colorings for networks.
• Backbone colorings of graphs with bounded degree

zbMATH Keywords

graph algorithmsbounded-degree graphsbackbone chromatic number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Some simplified NP-complete graph problems
• Combinatorial Geometry and Graph Theory
• \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
• Backbone colorings for graphs: Tree and path backbones
• The backbone coloring problem for bipartite backbones
• Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars

Cited In (7)

• Backbone colorings of graphs with bounded degree
• The computational complexity of the backbone coloring problem for planar graphs with connected backbones
• The computational complexity of \(\lambda\)-backbone colorings of graphs with \(n\)-complete backbones
• On \(\lambda\)-backbone coloring of cliques with tree backbones in linear time
• Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem
• On the hardness of computing span of subcubic graphs
• A theoretical analysis of backtracking in the graph coloring problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477637)