Cover Image

Constructions of minimally $t$-tough regular graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Cheng, Kun, Li, Chengli, Liu, Feng
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

An Ore-type condition for hamiltonicity in graphs
by: Li, Chengli, et al.
Published: (2025)

Longest cycles and longest chordless cycles in $2$-connected graphs
by: Hu, Yanan, et al.
Published: (2024)

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

On minimally tough chordal graphs
by: Dallard, Clément, et al.
Published: (2022)

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

A lower bound of toughness of regular graphs: in terms of second largest eigenvalue
by: Zhang, Wenqian
Published: (2026)

Bound vertices of longest paths between two vertices in cubic graphs
by: Li, Chengli, et al.
Published: (2024)

The maximum number of cliques in graphs with given fractional matching number and minimum degree
by: Li, Chengli, et al.
Published: (2024)

Cycles and paths through specified vertices in graphs with a given clique number
by: Li, Chengli, et al.
Published: (2025)

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

Cycles and paths through vertices whose degrees are at least the bipartite-hole-number
by: Li, Chengli, et al.
Published: (2025)

Degree sequence condition for Hamiltonicity in tough graphs
by: Shan, Songling, 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 spanning $k$-trees in tough graphs
by: Jia, Caili, et al.
Published: (2026)

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

Distance signless Laplacian spectral radius and tough graphs involving minimun degree
by: Liu, Xiangge, 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)

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

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

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

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

Cycles of consecutive lengths in $3$-connected graphs
by: Li, Chengli, et al.
Published: (2025)

Spectral radius, toughness and $k$-factor of graphs
by: Chen, Yuanyuan, et al.
Published: (2026)

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

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

Fractional factors and component factors in graphs with isolated toughness smaller than 1
by: Wolf, Isaak H.
Published: (2023)

The maximum number of paths of a given length in a nonhamiltonian graph
by: Li, Chengli, et al.
Published: (2026)

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

The spectral radii and extremal graphs of two types of minimal graphs
by: Lian, Liwen, et al.
Published: (2025)

Every $2$-connected $[4, 2]$-graph of order at least seven contains a pancyclic edge
by: Li, Chengli, et al.
Published: (2025)

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

Generalized toughness and Q-index in a graph
by: Zhou, Sizhong
Published: (2025)

On Lichnerowicz sharp distance-regular graphs
by: Chen, Kaizhe, et al.
Published: (2026)

The detour covering number and cummerbund covering number of a graph
by: Li, Chengli, et al.
Published: (2025)

Every $2k$-connected $(P_2\cup kP_1)$-free graph with toughness greater than one is hamiltonian-connected
by: Liu, Feng
Published: (2025)

On minimal k-factor-critical planar graphs
by: Li, Qiuli, et al.
Published: (2025)

Asymptotic expansion of regular and connected regular graphs
by: de Panafieu, Élie
Published: (2024)

Coloring minimal Cayley graphs
by: García-Marco, Ignacio, et al.
Published: (2024)

Construction of non-regular $A_α$-cospectral graphs from some join of graphs
by: K, Najiya V, et al.
Published: (2022)

Extending two results on hamiltonian graphs involving the bipartite-hole-number
by: Cheng, Kun, et al.
Published: (2025)