Pages that link to "Item:Q477637"
From MaRDI portal
The following pages link to The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637):
Displaying 6 items.
- On the hardness of computing span of subcubic graphs (Q888955) (← links)
- Backbone colorings of graphs with bounded degree (Q968172) (← links)
- The computational complexity of the backbone coloring problem for planar graphs with connected backbones (Q2341776) (← links)
- Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem (Q2482999) (← links)
- A theoretical analysis of backtracking in the graph coloring problem (Q3736910) (← links)
- On \(\lambda\)-backbone coloring of cliques with tree backbones in linear time (Q6595513) (← links)
