482 research outputs found
Towards obtaining a 3-Decomposition from a perfect Matching
A decomposition of a graph is a set of subgraphs whose edges partition those
of . The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011
states that every connected cubic graph can be decomposed into a spanning tree,
a 2-regular subgraph, and a matching. It has been settled for special classes
of graphs, one of the first results being for Hamiltonian graphs. In the past
two years several new results have been obtained, adding the classes of plane,
claw-free, and 3-connected tree-width 3 graphs to the list.
In this paper, we regard a natural extension of Hamiltonian graphs: removing
a Hamiltonian cycle from a cubic graph leaves a perfect matching. Conversely,
removing a perfect matching from a cubic graph leaves a disjoint union
of cycles. Contracting these cycles yields a new graph . The graph is
star-like if is a star for some perfect matching , making Hamiltonian
graphs star-like. We extend the technique used to prove that Hamiltonian graphs
satisfy the 3-decomposition conjecture to show that 3-connected star-like
graphs satisfy it as well.Comment: 21 pages, 7 figure
Supereulerian Properties in Graphs and Hamiltonian Properties in Line Graphs
Following the trend initiated by Chvatal and Erdos, using the relation of independence number and connectivity as sufficient conditions for hamiltonicity of graphs, we characterize supereulerian graphs with small matching number, which implies a characterization of hamiltonian claw-free graph with small independence number.;We also investigate strongly spanning trailable graphs and their applications to hamiltonian connected line graphs characterizations for small strongly spanning trailable graphs and strongly spanning trailable graphs with short longest cycles are obtained. In particular, we have found a graph family F of reduced nonsupereulerian graphs such that for any graph G with kappa\u27(G) ≥ 2 and alpha\u27( G) ≤ 3, G is supereulerian if and only if the reduction of G is not in F..;We proved that any connected graph G with at most 12 vertices, at most one vertex of degree 2 and without vertices of degree 1 is either supereulerian or its reduction is one of six exceptional cases. This is applied to show that if a 3-edge-connected graph has the property that every pair of edges is joined by a longest path of length at most 8, then G is strongly spanning trailable if and only if G is not the wagner graph.;Using charge and discharge method, we prove that every 3-connected, essentially 10-connected line graph is hamiltonian connected. We also provide a unified treatment with short proofs for several former results by Fujisawa and Ota in [20], by Kaiser et al in [24], and by Pfender in [40]. New sufficient conditions for hamiltonian claw-free graphs are also obtained
On some intriguing problems in Hamiltonian graph theory -- A survey
We survey results and open problems in Hamiltonian graph theory centred around three themes: regular graphs, -tough graphs, and claw-free graphs
Some local--global phenomena in locally finite graphs
In this paper we present some results for a connected infinite graph with
finite degrees where the properties of balls of small radii guarantee the
existence of some Hamiltonian and connectivity properties of . (For a vertex
of a graph the ball of radius centered at is the subgraph of
induced by the set of vertices whose distance from does not
exceed ). In particular, we prove that if every ball of radius 2 in is
2-connected and satisfies the condition for
each path in , where and are non-adjacent vertices, then
has a Hamiltonian curve, introduced by K\"undgen, Li and Thomassen (2017).
Furthermore, we prove that if every ball of radius 1 in satisfies Ore's
condition (1960) then all balls of any radius in are Hamiltonian.Comment: 18 pages, 6 figures; journal accepted versio
Degree and neighborhood conditions for hamiltonicity of claw-free graphs
For a graph H , let σ t ( H ) = min { Σ i = 1 t d H ( v i ) | { v 1 , v 2 , … , v t } is an independent set in H } and let U t ( H ) = min { | ⋃ i = 1 t N H ( v i ) | | { v 1 , v 2 , ⋯ , v t } is an independent set in H } . We show that for a given number ϵ and given integers p ≥ t \u3e 0 , k ∈ { 2 , 3 } and N = N ( p , ϵ ) , if H is a k -connected claw-free graph of order n \u3e N with δ ( H ) ≥ 3 and its Ryjác̆ek’s closure c l ( H ) = L ( G ) , and if d t ( H ) ≥ t ( n + ϵ ) ∕ p where d t ( H ) ∈ { σ t ( H ) , U t ( H ) } , then either H is Hamiltonian or G , the preimage of L ( G ) , can be contracted to a k -edge-connected K 3 -free graph of order at most max { 4 p − 5 , 2 p + 1 } and without spanning closed trails. As applications, we prove the following for such graphs H of order n with n sufficiently large:
(i) If k = 2 , δ ( H ) ≥ 3 , and for a given t ( 1 ≤ t ≤ 4 ), then either H is Hamiltonian or c l ( H ) = L ( G ) where G is a graph obtained from K 2 , 3 by replacing each of the degree 2 vertices by a K 1 , s ( s ≥ 1 ). When t = 4 and d t ( H ) = σ 4 ( H ) , this proves a conjecture in Frydrych (2001).
(ii) If k = 3 , δ ( H ) ≥ 24 , and for a given t ( 1 ≤ t ≤ 10 ) d t ( H ) \u3e t ( n + 5 ) 10 , then H is Hamiltonian. These bounds on d t ( H ) in (i) and (ii) are sharp. It unifies and improves several prior results on conditions involved σ t and U t for the hamiltonicity of claw-free graphs. Since the number of graphs of orders at most max { 4 p − 5 , 2 p + 1 } are fixed for given p , improvements to (i) or (ii) by increasing the value of p are possible with the help of a computer
The Cycle Spectrum of Claw-free Hamiltonian Graphs
If is a claw-free hamiltonian graph of order and maximum degree
with , then has cycles of at least many different lengths.Comment: 9 page
- …