721 search results - page 3 / 145 » Almost universal graphs |
DM
2006
13 years 5 months ago
2006
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...
STOC
2002
ACM
14 years 5 months ago
2002
ACM
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...
MP
2006
13 years 5 months ago
2006
Graphs with circular symmetry, called webs, are relevant w.r.t. describing the stable set polytopes of two larger graph classes, quasi-line graphs [8,12] and claw-free graphs [7,8]...
AGP
1994
IEEE
13 years 9 months ago
1994
IEEE
act Interpretation Framework for (almost) Full Prolog1 B. Le Charlier S. Rossi P. Van Hentenryck University of Namur University of Padova Brown University 21 rue Grandgagnage 7 via...
MST
2010
13 years 3 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...