Pages that link to "Item:Q288235"
From MaRDI portal
The following pages link to A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235):
Displaying 11 items.
- An \(O(n\log n)\) algorithm for finding edge span of cacti (Q281767) (← links)
- On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic (Q666002) (← links)
- 2-distance vertex-distinguishing index of subcubic graphs (Q724740) (← links)
- On \(t\)-relaxed 2-distant circular coloring of graphs (Q2045235) (← links)
- On \(d_2\)-coloring of certain families of graphs (Q2091583) (← links)
- Two-distance vertex-distinguishing index of sparse subcubic graphs (Q2186287) (← links)
- Optimal \(r\)-dynamic coloring of sparse graphs (Q2424825) (← links)
- Algorithms for finding distance-edge-colorings of graphs (Q2457301) (← links)
- Distance vertex-distinguishing index of outerplanar graphs (Q2824704) (← links)
- 2-distance vertex-distinguishing total coloring of graphs (Q4634521) (← links)
- Two-distance vertex-distinguishing index of sparse graphs (Q6611486) (← links)
