Pages that link to "Item:Q1406032"

The following pages link to The complexity of the \(T\)-coloring problem for graphs with small degree (Q1406032):

Displaying 3 items.

• Greedy \(T\)-colorings of graphs (Q1024485) (← links)
• A polynomial algorithm for finding \(T\)-span of generalized cacti (Q1406033) (← links)
• \(T\)-colorings, divisibility and the circular chromatic number (Q2227106) (← links)