1729 search results - page 71 / 346 » On Bounds for the k-Partitioning of Graphs |
JGT
2006
15 years 6 months ago
2006
144
click to vote
GD
2004
Springer
15 years 11 months ago
2004
Springer
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...
161
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
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 ...