Pages that link to "Item:Q2341776"
From MaRDI portal
The following pages link to The computational complexity of the backbone coloring problem for planar graphs with connected backbones (Q2341776):
Displaying 3 items.
- The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones (Q477637) (← links)
- A theoretical analysis of backtracking in the graph coloring problem (Q3736910) (← links)
- On the greatest number of 2 and 3 colorings of a (v, e)-graph (Q3832593) (← links)