Pages that link to "Item:Q2341776"

The following pages link to The computational complexity of the backbone coloring problem for planar graphs with connected backbones (Q2341776):

Displaying 1 item.

• On the greatest number of 2 and 3 colorings of a (v, e)-graph (Q3832593) (← links)