643 search results - page 44 / 129 » Supereulerian planar graphs |
COMBINATORICA
2010
13 years 4 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
COCO
2010
Springer
14 years 1 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
ESA
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
TAMC
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
COMBINATORICA
2008
13 years 9 months ago
2008
We prove that any H-minor-free graph, for a fixed graph H, of treewidth w has an (w)