Pages that link to "Item:Q3705474"
From MaRDI portal
The following pages link to Efficient Vertex- and Edge-Coloring of Outerplanar Graphs (Q3705474):
Displaying 13 items.
- Max point-tolerance graphs (Q344833) (← links)
- A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) (← links)
- Backbone colouring: tree backbones with small diameter in planar graphs (Q387001) (← links)
- Graph classes and Ramsey numbers (Q400493) (← 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)
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs (Q2104935) (← links)
- A heuristic for the coloring of planar graphs (Q2133446) (← links)
- One-bend drawings of outerplanar graphs inside simple polygons (Q2151442) (← links)
- The maximum \(k\)-differential coloring problem (Q2407949) (← links)
- The complexity of pebbling reachability and solvability in planar and outerplanar graphs (Q2449128) (← links)
- Vertex-Coloring with Star-Defects (Q2803807) (← links)
- Inductive graph invariants and approximation algorithms (Q5101914) (← links)