Pages that link to "Item:Q1329800"
From MaRDI portal
The following pages link to Hard-to-color graphs for connected sequential colorings (Q1329800):
Displaying 5 items.
- Connected greedy coloring of \(H\)-free graphs (Q777440) (← links)
- Hard-to-color graphs for connected sequential colorings (Q1329800) (← links)
- The smallest hard-to-color graph for the SL algorithm (Q1356706) (← links)
- The connected greedy coloring game (Q2699943) (← links)
- Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly (Q6599810) (← links)
