Cover Image

Degree sequence condition for Hamiltonicity in tough graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shan, Songling, Tanyel, Arthur
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A strengthening of a degree sequence condition for Hamiltonicity in tough graphs
by: Shan, Songling, et al.
Published: (2025)

Hamilton cycles in tough $(2P_2 \cup P_1)$-free graphs
by: Shan, Songling, et al.
Published: (2025)

Hamiltonian cycles in tough $(P_4 \cup P_1)$-free graphs
by: Shan, Songling
Published: (2025)

A construction of a $\frac{3}{2}$-tough plane triangulation with no 2-factor
by: Shan, Songling
Published: (2022)

2-factors in $\frac{3}{2}$-tough maximal planar graphs
by: Hao, Lili, et al.
Published: (2025)

Degree sequences realizing labelled perfect matchings
by: Briggs, Joseph, et al.
Published: (2025)

A spectral condition for Hamilton cycles in tough bipartite graphs
by: Ai, Lianyang, et al.
Published: (2025)

Cliques and High Odd Holes in Graphs with Chromatic Number Equal to Maximum Degree
by: Galindo, Rachel, et al.
Published: (2025)

Equitable tree colouring of graphs
by: Gao, Yuping, et al.
Published: (2026)

Towards the Overfull Conjecture
by: Shan, Songling
Published: (2023)

Vertex-distinguishing and sum-distinguishing edge coloring of regular graphs
by: Gao, Yuping, et al.
Published: (2024)

On the Hamiltonicity, traceability and toughness of complements of line graphs
by: Mammoliti, Adam
Published: (2026)

Sufficient conditions for spanning $k$-trees in tough graphs
by: Jia, Caili, et al.
Published: (2026)

Sufficient conditions for $t$-tough graphs to be Hamiltonian and pancyclic or bipartite
by: Liu, Xiangge, et al.
Published: (2025)

A sufficient condition for a hypergraph to have a Berge-$k$-factor
by: Gao, Yuping, et al.
Published: (2023)

Vertex-distinguishing edge coloring of graphs
by: Gao, Yuping, et al.
Published: (2025)

Dirac-type condition for Hamilton-generated graphs
by: Hou, Xinmin, et al.
Published: (2025)

Spanning Euler Tours in Hypergraphs
by: Bahmanian, Amin, et al.
Published: (2024)

Linear arboricity of robust expanders
by: Gao, Yuping, et al.
Published: (2024)

Graceful Labeling of Two Families of Spiders
by: Shan, Songling, et al.
Published: (2026)

Total coloring graphs with large maximum degree
by: Dalal, Aseem, et al.
Published: (2024)

Total coloring graphs with large minimum degree
by: Henderschedt, Owen, et al.
Published: (2025)

Sufficient conditions for the variation of toughness under the distance spectral in graphs involving minimum degree
by: Li, Peishan
Published: (2025)

Constructions of minimally $t$-tough regular graphs
by: Cheng, Kun, et al.
Published: (2024)

An exact Ore-degree condition for Hamilton cycles in oriented graphs
by: Chang, Yulin, et al.
Published: (2025)

Spectral conditions of pancyclicity for t-tough graphs
by: Benediktovich, Vladimir I.
Published: (2024)

Tight spectral conditions for the Hamiltonicity of $K_{1,r}$-free split graphs
by: Cai, Yiting, et al.
Published: (2026)

Minimal toughness in special graph classes
by: Katona, Gyula Y., et al.
Published: (2018)

The Hamilton space of pseudorandom graphs
by: Christoph, Micha, et al.
Published: (2024)

Hamiltonicity of Cartesian products of graphs
by: Ladinek, Irena Hrastnik, et al.
Published: (2024)

Hamiltonicity of inhomogeneous random graphs
by: Garbe, Frederik, et al.
Published: (2026)

Hamiltonicity of covering graphs of trees
by: Bradshaw, Peter, et al.
Published: (2022)

Eigenvalues, edge-disjoint perfect matchings and toughness of regular graphs
by: Zhang, Wenqian
Published: (2024)

On the existence of minimally tough graphs having large minimum degrees
by: Hasanvand, Morteza
Published: (2025)

Minimally tough series-parallel graphs with toughness at least $1/2$
by: Katona, Gyula Y., et al.
Published: (2025)

The Hamilton cycle space of random graphs
by: Hefetz, Dan, et al.
Published: (2025)

Robust Hamiltonicity in families of Dirac graphs
by: Anastos, Michael, et al.
Published: (2023)

Colorful Hamilton cycles in random graphs
by: Chakraborti, Debsoumya, et al.
Published: (2021)

Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition
by: Ai, Jiangdong, et al.
Published: (2025)

Pseudo-multifan and Lollipop
by: Cao, Yan, et al.
Published: (2021)