Pages that link to "Item:Q2441359"
From MaRDI portal
The following pages link to \(d\)-strong edge colorings of graphs (Q2441359):
Displaying 3 items.
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235) (← links)
- Arbitrarily large difference between \(d\)-strong chromatic index and its trivial lower bound (Q383771) (← links)
- Distant set distinguishing edge colourings of graphs (Q1686263) (← links)
