Pages that link to "Item:Q1701101"
From MaRDI portal
The following pages link to Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (Q1701101):
Displaying 4 items.
- On bipartization of cubic graphs by removal of an independent set (Q298966) (← links)
- The NP-completeness of (1,r)-subcolorability of cubic graphs (Q1603517) (← links)
- Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling (Q4971610) (← links)
- Equitable colorings of \(l\)-corona products of cubic graphs (Q6577196) (← links)