Longest cycles in r-regular r-connected graphs
نویسندگان
چکیده
منابع مشابه
Longest Cycles in 3-connected 3-regular Graphs
I n t r o d u c t i o n . In this paper, we s tudy the following quest ion: How long a cycle must there be in a 3-connected 3-regular graph on n vertices? For planar graphs this question goes back to T a i t [6], who conjectured tha t any planar 3-connected 3-regular graph is hamiltonian. T u t t e [7] disproved this conjecture by finding a counterexample on 46 vertices. Using Tu t t e ' s exam...
متن کاملDeficiencies of r-regular k-edge-connected graphs
Let G be a simple graph having a maximum matching M. The deficiency def(G) of G is the number of M-unsaturated vertices in G. A problem that arises is that of determining the set of possible values of def(G). In this paper we present a solution for the case of r-regular k-edge-connected graphs. 1. INTRODUCTION In this paper the graphs are finite, loopless and have no multiple edges. For the mos...
متن کاملGenerating r-regular graphs
For each nonnegative integer r we determine a set of graph operations such that all r regular loopless graphs can be generated from the smallest r regular loopless graphs by using these operations We also discuss possible extensions of this result to r regular graphs of girth at least g for each xed g
متن کاملHamilton cycles in regular 3-connected graphs
This result is best possible for k = 3 since the Petersen graph is a nonhamiltonian, 2-connected, 3-regular graph on 10 vertices. It is essentially best possible for k > 4 since there exist non-hamiltonian, 2-connected, kregular graphs on 3k + 4 vertices for k even, and 3k + 5 vertices for all k. Examples of such graphs are given in [ 1, 3 1. The problem of determining the values of k for which...
متن کاملOn Longest Cycles in Essentially 4-connected Planar Graphs
A planar 3-connected graph G is essentially 4-connected if for any 3-separator S of G, one component of the graph obtained from G by removing S is a single vertex. B. Jackson and N.C. Wormald proved that an essentially 4-connected planar graph on n vertices contains a cycle C such that |V (C)| ≥ 2n+4 5 . For a cubic essentially 4-connected planar graph G, B. Grünbaum, J. Malkevitch , and C.-Q. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1982
ISSN: 0095-8956
DOI: 10.1016/0095-8956(82)90001-6