4171 search results - page 94 / 835 » Choice numbers of graphs |
192
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
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...
162
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
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...
165
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
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...
161
click to vote
ALENEX
2007
15 years 7 months ago
2007
We present a novel randomized approach to the graph isomorphism problem. Our algorithm aims at solving difficult instances by producing randomized certificates for non-isomorphis...
164
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 ...