Sciweavers

3268 search results - page 81 / 654
» The hub number of a graph
Sort
View
CPC
1998
64views more  CPC 1998»
15 years 6 months ago
Isoperimetric Inequalities for Cartesian Products of Graphs
We give a characterization for isoperimetric invariants, including the Cheeger constant and the isoperimetric number of a graph. This leads to an isoperimetric inequality for the ...
Fan R. K. Chung, Prasad Tetali
COMGEO
2007
ACM
15 years 6 months ago
Graph drawings with few slopes
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
Vida Dujmovic, Matthew Suderman, David R. Wood
SWAT
1994
Springer
113views Algorithms» more  SWAT 1994»
15 years 10 months ago
Trapezoid Graphs and Generalizations, Geometry and Algorithms
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...
Stefan Felsner, Rudolf Müller, Lorenz Wernisc...
COMBINATORICS
2006
121views more  COMBINATORICS 2006»
15 years 6 months ago
Identifying Graph Automorphisms Using Determining Sets
A set of vertices S is a determining set for a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of a graph is the size of a sma...
Debra L. Boutin
SODA
2000
ACM
121views Algorithms» more  SODA 2000»
15 years 7 months ago
Coloring powers of planar graphs
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
Geir Agnarsson, Magnús M. Halldórsso...