The following pages link to Edge-Coloring Partialk-Trees (Q3837389):
Displayed 13 items.
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- 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)
- List Edge-Coloring and Total Coloring in Graphs of Low Treewidth (Q2800543) (← links)
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds (Q3057611) (← links)
- A POLYNOMIAL-TIME ALGORITHM FOR FINDING TOTAL COLORINGS OF PARTIAL k-TREES (Q5248998) (← links)
- Chromatic index, treewidth and maximum degree (Q5892299) (← links)
- Chromatic index, treewidth and maximum degree (Q5916063) (← links)
- Clique-perfectness of complements of line graphs (Q5919747) (← links)
- The edge-disjoint paths problem is NP-complete for series-parallel graphs (Q5954246) (← links)
- Linear arboricity of degenerate graphs (Q6094033) (← links)