3471 search results - page 107 / 695 » Obstacle Numbers of Graphs |
141
click to vote
JGT
2008
15 years 4 months ago
2008
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....
126
click to vote
GD
2005
Springer
15 years 9 months ago
2005
Springer
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
132
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a...
138
click to vote
COCOON
2006
Springer
15 years 7 months ago
2006
Springer
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...
138
click to vote
CJCDGCGT
2005
Springer
15 years 6 months ago
2005
Springer
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...