306 search results - page 9 / 62 » Computing the Girth of a Planar Graph |
ICCS
2001
Springer
15 years 2 months ago
2001
Springer
GD
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
GC
2007
Springer
14 years 9 months ago
2007
Springer
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m ...
82
Voted
GD
2005
Springer
15 years 3 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....
GD
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...