The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Combinatorial Geometry and Graph Theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Backbone colorings for graphs: Tree and path backbones / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \(\lambda \)-backbone colorings along pairwise disjoint stars and matchings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The backbone coloring problem for bipartite backbones / rank | |||
Normal rank | |||
Latest revision as of 11:03, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones |
scientific article |
Statements
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (English)
0 references
9 December 2014
0 references
bounded-degree graphs
0 references
backbone chromatic number
0 references
graph algorithms
0 references
