601 search results - page 24 / 121 » Edge-dominating cycles in graphs |
COMBINATORICS
2002
13 years 9 months ago
2002
We shall prove that for all 3 and > 0 there exists a sparse oriented graph of arbitrarily large order with oriented girth and such that any 1/2 + proportion of its arcs induc...
DM
2002
13 years 9 months ago
2002
It is known that the chromatic polynomial of any chordal graph has only integer roots. However, there also exist non-chordal graphs whose chromatic polynomials have only integer r...
ENTCS
2002
13 years 9 months ago
2002
We define a notion of type assignment with polymorphic intersection types of rank 2 for a term graph rewriting language that expresses sharing and cycles. We show that type assign...
WG
2009
Springer
14 years 4 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
COMBINATORICA
2010
13 years 5 months ago
2010
We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we charact...