Pages that link to "Item:Q1887062"
From MaRDI portal
The following pages link to A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062):
Displaying 13 items.
- Strong edge-coloring for cubic Halin graphs (Q408187) (← links)
- The strong chromatic index of Halin graphs (Q411659) (← links)
- On the strong chromatic index of cubic Halin graphs (Q419099) (← links)
- On the complexity of the flow coloring problem (Q499367) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- Proof of a conjecture on the strong chromatic index of Halin graphs (Q2043362) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- Strong edge chromatic index of the generalized Petersen graphs (Q2423067) (← links)
- Strong edge-colouring and induced matchings (Q2445264) (← links)
- Algorithms for finding distance-edge-colorings of graphs (Q2457301) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- Strong edge-coloring for jellyfish graphs (Q2515576) (← links)
- Edge-Coloring Partialk-Trees (Q3837389) (← links)