Cover Image

Sufficient conditions for $t$-tough graphs to be Hamiltonian and pancyclic or bipartite

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Liu, Xiangge, Jia, Caili, Lu, Yong, Zhong, Jiaxu
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Distance signless Laplacian spectral radius and tough graphs involving minimun degree
by: Liu, Xiangge, et al.
Published: (2025)

Scattering number and $τ$-toughness in graphs involving $A_α$-spectral radius
by: Jia, Caili, et al.
Published: (2025)

Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical
by: Zhong, Jiaxu, et al.
Published: (2026)

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

The existence of even factors based on the $A_α$-spectral radius of graphs
by: Jia, Caili, et al.
Published: (2025)

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

Some sufficient conditions for a graph with minimum degree to be $k$-critical with respect to $[1,b]$-odd factors
by: Zhong, Jiaxu, et al.
Published: (2026)

Sufficient conditions for bipartite rigidity, symmetric completability and hyperconnectivity of graphs
by: Garamvölgyi, Dániel, et al.
Published: (2025)

Edge pancyclic Cayley graphs on symmetric group
by: Cao, Mengyu, 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)

On the pancyclicity of $2$-connected $[5,3]$-graphs
by: Liu, Feng, et al.
Published: (2025)

A sufficient condition for pancyclic graphs
by: Zhan, Xingzhi
Published: (2024)

Weakly pancyclic vertices in dense nonbipartite graphs
by: Tang, Yurui, et al.
Published: (2026)

The completion numbers of Hamiltonicity and pancyclicity in random graphs
by: Alon, Yahav, et al.
Published: (2023)

The minimum edge-pancyclic graph of a given order
by: Zhao, Xiamiao, et al.
Published: (2025)

Degree sequence condition for Hamiltonicity in tough graphs
by: Shan, Songling, et al.
Published: (2024)

Rainbow vertex pair-pancyclicity of strongly edge-colored graphs
by: Zhao, Peixue, et al.
Published: (2022)

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

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

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

The vertex-pancyclicity of the simplified shuffle-cube and the vertex-bipancyclicity of the balanced shuffle-cube
by: Liu, Yasong, et al.
Published: (2024)

Sufficient conditions for Hamiltonianity in terms of the Zeroth-order General Randić Index
by: Wang, Shuai, et al.
Published: (2026)

Sufficient spectral conditions for graphs being $k$-edge-Hamiltonian or $k$-Hamiltonian
by: Li, Yongtao, et al.
Published: (2021)

Hamiltonian cycles in $ 15 $-tough ($ P_{3}\cup 3P_{1} $)-free graphs
by: Ma, Hui, et al.
Published: (2025)

Connectivity keeping trees in 3-connected bipartite graphs with girth conditions
by: Yang, Qing, et al.
Published: (2023)

Two-disjoint-cycle-cover vertex pancyclicity of split-star networks
by: Liu, Chang, et al.
Published: (2026)

On Hamiltonian bypasses in digraphs and bipartite digraphs
by: Darbinyan, Samvel Kh.
Published: (2025)

Sufficient conditions for even factors in graphs
by: Zhou, Sizhong, et al.
Published: (2025)

The generalized Tur'{a}n number of long cycles in graphs and bipartite graphs
by: Dong, Changchang, et al.
Published: (2024)

The left row rank of quaternion unit gain graphs in terms of girth
by: Lu, Yong, et al.
Published: (2024)

On bipartite biregular large graphs
by: Araujo-Pardo, G., et al.
Published: (2024)

Sufficient conditions for closed-trailable in digraphs
by: Dong, Changchang, et al.
Published: (2024)

On quadratic embeddability of bipartite graphs and theta graphs
by: Młotkowski, Wojciech, et al.
Published: (2024)

Turán number of complete bipartite graphs with bounded matching number
by: Luo, Huan, et al.
Published: (2024)

The minimum size and maximum diameter of an edge-pancyclic graph of a given order
by: Li, Chengli, et al.
Published: (2024)

Sufficient conditions for a digraph to contain: a pre-Hamiltonian cycle and cycles of lengths 3 and 4
by: Darbinyan, Samvel Kh.
Published: (2025)

Word-representability of co-bipartite graph
by: Das, Biswajit, et al.
Published: (2025)

Flow polytopes for extensions of bipartite graphs
by: Braun, Benjamin, et al.
Published: (2025)

On the construction of cospectral nonisomorphic bipartite graphs
by: Kannan, M. Rajesh, et al.
Published: (2021)