Pages that link to "Item:Q2264774"
From MaRDI portal
The following pages link to On the chromatic index of outerplanar graphs (Q2264774):
Displaying 12 items.
- The \((p,q)\)-total labeling problem for trees (Q408175) (← links)
- A tight upper bound on the (\(2,1\))-total labeling number of outerplanar graphs (Q450562) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Optimally edge-colouring outerplanar graphs is in NC (Q909461) (← links)
- Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328) (← links)
- On dispersability of some products of cycles (Q2116698) (← links)
- Improper interval edge colorings of graphs (Q2235270) (← links)
- \((2,1)\)-total labelling of outerplanar graphs (Q2462398) (← links)
- Reflexive coloring complexes for 3-edge-colorings of cubic graphs (Q2659215) (← links)
- Efficient Vertex- and Edge-Coloring of Outerplanar Graphs (Q3705474) (← links)
- On the maximum number of edges in planar graphs of bounded degree and matching number (Q6041557) (← links)
- Conflict-free incidence coloring of outer-1-planar graphs (Q6639485) (← links)