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