Pages that link to "Item:Q4971610"
From MaRDI portal
The following pages link to Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling (Q4971610):
Displaying 5 items.
- On bipartization of cubic graphs by removal of an independent set (Q298966) (← links)
- Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs (Q1701101) (← links)
- Scheduling identical jobs on uniform machines with a conflict graph (Q2273690) (← links)
- Equitable coloring of hypergraphs (Q2414464) (← links)
- Scheduling on uniform machines with a conflict graph: complexity and resolution (Q6187242) (← links)
