The following pages link to Edge-Coloring Partialk-Trees (Q3837389):
Displayed 6 items.
- Mixed graph edge coloring (Q1043571) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Algorithms for finding distance-edge-colorings of graphs (Q2457301) (← links)
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds (Q3057611) (← links)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)