Sciweavers

1729 search results - page 71 / 346
» On Bounds for the k-Partitioning of Graphs
Sort
View
JEA
2008
64views more  JEA 2008»
14 years 10 months ago
Fast computation of empirically tight bounds for the diameter of massive graphs
Clémence Magnien, Matthieu Latapy, Michel H...
JGT
2006
28views more  JGT 2006»
14 years 10 months ago
New upper bounds on the decomposability of planar graphs
Fedor V. Fomin, Dimitrios M. Thilikos
ECCC
2007
91views more  ECCC 2007»
14 years 10 months ago
Testing Expansion in Bounded Degree Graphs
Satyen Kale, C. Seshadhri
GD
2004
Springer
15 years 3 months ago
Really Straight Graph Drawings
We study straight-line drawings of graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, a...
Vida Dujmovic, Matthew Suderman, David R. Wood
SODA
2000
ACM
121views Algorithms» more  SODA 2000»
14 years 11 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...