The following pages link to Edge-Coloring Partialk-Trees (Q3837389):
Displaying 25 items.
- The parameterised complexity of list problems on graphs of bounded treewidth (Q342709) (← links)
- Oriented colorings of partial 2-trees (Q975406) (← links)
- Mixed graph edge coloring (Q1043571) (← links)
- A linear algorithm for finding \([g,f]\)-colorings of partial \(k\)-trees (Q1578404) (← links)
- Linear-time algorithms for partial \(k\)-tree complements (Q1578411) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- A linear time algorithm for edge coloring of binomial trees (Q1916114) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Algorithms for finding distance-edge-colorings of graphs (Q2457301) (← links)
- The \(k\)-path coloring problem in graphs of bounded treewidth: an application in integrated circuit manufacturing (Q2661539) (← 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)
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees (Q3204040) (← links)
- Edge coloring a k-tree into two smaller trees (Q4347271) (← links)
- (Q4551368) (← links)
- A parallel algorithm for edge-coloring partial k-trees (Q5054775) (← 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)
- Finding edge-disjoint paths in partial k-trees (Q6487440) (← links)
- Algorithms for finding f-colorings of partial k-trees (Q6487980) (← links)
