Sciweavers

643 search results - page 3 / 129
» Supereulerian planar graphs
Sort
View
COCOON
1999
Springer
13 years 9 months ago
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
Xuemin Lin, Peter Eades
SIAMDM
2000
59views more  SIAMDM 2000»
13 years 5 months ago
Nonhamiltonian 3-Connected Cubic Planar Graphs
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamil...
Robert E. L. Aldred, S. Bau, Derek A. Holton, Bren...
WADS
2001
Springer
143views Algorithms» more  WADS 2001»
13 years 9 months ago
An Approach for Mixed Upward Planarization
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization...
Markus Eiglsperger, Michael Kaufmann
GC
2002
Springer
13 years 5 months ago
n-Tuple Coloring of Planar Graphs with Large Odd Girth
The main result of the papzer is that any planar graph with odd girth at least 10k
William Klostermeyer, Cun-Quan Zhang
GD
2007
Springer
13 years 11 months ago
Minimizing the Area for Planar Straight-Line Grid Drawings
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid draw...
Marcus Krug, Dorothea Wagner