Pages that link to "Item:Q2441359"
From MaRDI portal
The following pages link to \(d\)-strong edge colorings of graphs (Q2441359):
Displaying 13 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)
- On the computational complexity of strong edge coloring (Q1602692) (← links)
- Distant set distinguishing edge colourings of graphs (Q1686263) (← links)
- Strong edge-coloring of pseudo-Halin graphs (Q2302063) (← links)
- \(d\)-strong total colorings of graphs (Q2346331) (← links)
- Strong edge-colouring and induced matchings (Q2445264) (← links)
- Strong edge-coloring for jellyfish graphs (Q2515576) (← links)
- Distant set distinguishing total colourings of graphs (Q2629496) (← links)
- 当24≤d≤34时圈的d-强全染色 (Q2984404) (← links)
- \(d\)-strong total colorings of cycles when \(35\leq d\leq 55\) (Q2992660) (← links)
- (Q3320410) (← links)
- Θ-graphs of partial cubes and strong edge colorings (Q3439627) (← links)