The following pages link to (Q5294976):
Displaying 11 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)
- 2-distance vertex-distinguishing index of subcubic graphs (Q724740) (← links)
- \(D(\beta)\)-vertex-distinguishing total coloring of graphs (Q867795) (← links)
- Distant set distinguishing edge colourings of graphs (Q1686263) (← links)
- A characterization of graphs with regular distance-2 graphs (Q2097182) (← links)
- \(d\)-strong edge colorings of graphs (Q2441359) (← links)
- Distant set distinguishing total colourings of graphs (Q2629496) (← links)
- Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time (Q3467875) (← links)
- \(D(2)\)-vertex-distinguishing edge coloring of unicyclic graphs (Q5017065) (← links)
- (Q5393536) (← links)
