347 search results - page 5 / 70 » Schaefer's theorem for graphs |
ECCC
2007
13 years 9 months ago
2007
Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined i...
STOC
1990
ACM
14 years 1 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
ARSCOM
2004
13 years 9 months ago
2004
We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...
STOC
2002
ACM
14 years 10 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
CPC
2006
13 years 9 months ago
2006
Let ;k g be the class of k-connected cubic graphs of girth at least g. For several choices of k and g, we determine a set Ok g of graph operations, for which, if G and H are graph...