scientific article
From MaRDI portal
Publication:2741507
zbMath0981.05043MaRDI QIDQ2741507
Publication date: 24 October 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- An \(0(n^{1.5})\) algorithm to color proper circular arcs
- Intersection graphs of Helly families of subtrees
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
- The Complexity of Coloring Circular Arcs and Chords
- Coloring a Family of Circular Arcs
- Revisiting Tucker's Algorithm to Color Circular Arc Graphs
This page was built for publication:
