Circumference of 3-connected cubic graphs
نویسندگان
چکیده
منابع مشابه
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
The circumference of a graph is the length of its longest cycles. Results of Jackson, and Jackson and Wormald, imply that the circumference of a 3-connected cubic n-vertex graph is Ω(n), and the circumference of a 3-connected claw-free graph is Ω(n). We generalise and improve the first result by showing that every 3-edge-connected graph with m edges has an Eulerian subgraph with Ω(m) edges. We ...
متن کاملNonhamiltonian 3-Connected Cubic Planar Graphs
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamiltonian such graphs of order 42. In addition we list all nonhamiltonian cyclically 5-connected cubic planar graphs of order at most 52 and all nonhamiltonian 3-connected cubic planar graphs of girth 5 on at most 46 vert...
متن کاملBounding the circumference of 3-connected claw-free graphs
The circumference of a graph is the length of its longest cycles. A result of Jackson and Wormald implies that the circumference of a 3-connected claw-free graph is at least 1 2 n150 . In this paper we improve this lower bound to Ω(n3 ), and our proof implies a polynomial time algorithm for finding a cycle of such length. Bondy and Simonovits showed that Θ(n9 ) is an upper bound. Partially supp...
متن کاملPacking 3-vertex Paths in Cubic 3-connected Graphs
Let v(G) and λ(G) be the number of vertices and the maximum number of disjoint 3-vertex paths in G, respectively. We discuss the following old Problem. Is the following claim true ? (P ) if G is a 3-connected and cubic graph, then λ(G) = bv(G)/3c. We show, in particular, that claim (P ) is equivalent to some seemingly stronger claims (see 3.1). It follows that if claim (P ) is true, then Reed’s...
متن کاملSmall cycle covers of 3-connected cubic graphs
Every 2-connected simple cubic graph of order n ≥ 6 has a cycle cover with at most dn4 e cycles. This bound is best possible.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2018
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2017.08.008