347 search results - page 34 / 70 » Schaefer's theorem for graphs |
125
click to vote
CPC
2007
15 years 1 months ago
2007
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. G.D. Birkhoff and D.C. Lewis showed that, if G is a plane near triangulation, then the only zeros of...
106
click to vote
GC
2010
Springer
15 years 3 days ago
2010
Springer
A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the n...
123
click to vote
JCT
2010
15 years 8 hour ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
141
click to vote
MKM
2004
Springer
15 years 7 months ago
2004
Springer
As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, ...
101
click to vote
COLT
2005
Springer
15 years 7 months ago
2005
Springer
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed “manifold-motivatedâ€...