Pages that link to "Item:Q5063668"
From MaRDI portal
The following pages link to Efficient algorithms for the edge-cover coloring problem (Q5063668):
Displaying 4 items.
- Partitioning series-parallel multigraphs into \(v^*\)-excluding edge covers (Q862738) (← links)
- Efficient algorithms for acyclic colorings of graphs (Q1978502) (← links)
- Approximation Algorithms for Edge-Covering Problem (Q3628568) (← links)
- An Efficient Algorithm for the Nearly Equitable Edge Coloring Problem (Q5301444) (← links)