Lai's Conditions for Spanning and Dominating Closed Trails

A graph is supereulerian if it has a spanning closed trail. For an integer $r$, let ${\cal Q}_0(r)$ be  the family of 3-edge-connected nonsupereulerian graphs of order at most $r$. For a graph $G$, define $\delta_L(G)=\min\{\max\{d(u), d(v) \}| \  \mbox{ for any $uv\in E(G)$} \}$. For a given integer $p\ge 2$ and a given real number $\epsilon$,  a graph $G$ of order $n$ is said to satisfy a Lai's condition if $\delta_L(G)\ge \frac{n}{p}-\epsilon$.  In this paper, we show that  if $G$ is  a  3-edge-connected graph of order $n$ with $\delta_L(G)\ge \frac{n}{p}-\epsilon$, then there is an integer $N(p, \epsilon)$ such that when $n> N(p,\epsilon)$, $G$ is supereulerian if and only if $G$ is not  a graph obtained from a  graph $G_p$ in the finite family ${\cal Q}_0(3p-5)$ by replacing some vertices in $G_p$ with nontrivial graphs. Results on the best possible Lai's  conditions for Hamiltonian line graphs of 3-edge-connected graphs or 3-edge-connected supereulerian graphs are given,  which are improvements of the results in [J. Graph Theory 42(2003) 308-319] and in [Discrete Mathematics, 310(2010) 2455-2459].

[1]  Mei Lu,et al.  Properties of Catlin's reduced graphs and supereulerian graphs , 2016, 1601.01365.

[2]  Hong-Jian Lai,et al.  Author's Personal Copy Discrete Mathematics the 3-connected Matroids with Circumference 6 , 2022 .

[3]  Hong-Jian Lai,et al.  Supereulerian Graphs and the Petersen Graph , 1996, J. Comb. Theory, Ser. B.

[4]  Zhi-Hong Chen,et al.  Fan-Type Conditions for Spanning Eulerian Subgraphs , 2015, Graphs Comb..

[5]  Hong-Jian Lai,et al.  Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs , 2003, J. Graph Theory.

[6]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[7]  Zdenek Ryjácek On a Closure Concept in Claw-Free Graphs , 1997, J. Comb. Theory, Ser. B.

[8]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[9]  Hong-Jian Lai,et al.  Graphs without spanning closed trails , 1996, Discret. Math..

[10]  C. L. Suffel THE SPANNING SUBGRAPHS OF EULERIAN GRAPHS * , 1979 .

[11]  Zhi-Hong Chen,et al.  Spanning Eulerian subgraphs and Catlin’s reduced graphs , 2016 .

[12]  Henk Jan Veldman,et al.  On circuits and pancyclic line graphs , 1986, J. Graph Theory.

[13]  Henk Jan Veldman On dominating and spanning circuits in graphs , 1994, Discret. Math..

[14]  J. E. Williamson,et al.  On Spanning and Dominating Circuits in Graphs , 1977, Canadian Mathematical Bulletin.

[15]  Zdeněk Ryjáčk On a Closure Concept in Claw-Free Graphs , 1997 .

[17]  Hong-Jian Lai Eulerian subgraphs containing given vertices and hamiltonian line graphs , 1998, Discret. Math..

[18]  Paul A. Catlin,et al.  A reduction method to find spanning Eulerian subgraphs , 1988, J. Graph Theory.

[19]  Zhi-Hong Chen Supereulerian graphs, independent sets, and degree-sum conditions , 1998, Discret. Math..

[20]  Leen Stougie,et al.  The traveling salesman problem on cubic and subcubic graphs , 2014, Math. Program..

[21]  William R. Pulleyblank,et al.  A note on graphs spanned by Eulerian graphs , 1979, J. Graph Theory.

[22]  Richard A. Brualdi,et al.  Hamiltonian line graphs , 1981, J. Graph Theory.

[23]  F. Harary,et al.  On Eulerian and Hamiltonian Graphs and Line Graphs , 1965, Canadian Mathematical Bulletin.

[24]  Paul A. Catlin Contractions of graphs with no spanning eulerian subgraphs , 1988, Comb..

[25]  Hong-Jian Lai,et al.  Collapsible graphs and matchings , 1993, J. Graph Theory.

[26]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .