The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2014.09.018
+Normal rank
@@ Property / OpenAlex ID @@
+W2045373821
@@ Property / OpenAlex ID: W2045373821 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Geometry and Graph Theory
@@ Property / cites work: Combinatorial Geometry and Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars
+Normal rank
@@ Property / cites work @@
+Backbone colorings for graphs: Tree and path backbones
+Normal rank
@@ Property / cites work @@
+\(\lambda \)-backbone colorings along pairwise disjoint stars and matchings
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+The backbone coloring problem for bipartite backbones
+Normal rank