14 search results - page 1 / 3 » On 3-regular 4-ordered graphs |
DM
2008
13 years 11 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v1, . . . , vk of G there exists a cycle (respectively, hamiltonian...
DM
2002
13 years 10 months ago
2002
It is shown that in a 4-connected maximal planar graph there is for any four vertices a, b, c and d, a cycle in the graph that contains the four vertices and visits them in the or...
IWOCA
2009
Springer
14 years 3 months ago
2009
Springer
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
An edge cover C of an undirected graph is a set of edges such that every vertex has an adjacent edge in C. We show that a Glauber dynamics Markov chain for edge covers mixes rapidl...
RSA
2006
13 years 10 months ago
2006
In this paper, we prove that there exists a function k = (4 + o(1))k such that G(n, /n) contains a k-regular graph with high probability whenever > k. In the case of k = 3, it...