22 search results - page 5 / 5 » Bar k-Visibility Graphs: Bounds on the Number of Edges, Chro... |
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
COCOON
2003
Springer
14 years 2 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...