:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Li, Peishan
Format:	Preprint
Published:	2025
Subjects:	Combinatorics
Online Access:	https://arxiv.org/abs/2503.23490
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

Sufficient conditions for a graph with minimum degree to have a component factor
by: Wu, Jie
Published: (2025)

Size and spectral conditions for a graph with given minimum degree to be $k$-$d$-critical
by: Zhang, Zhenhao, et al.
Published: (2026)

On the distance spectral radius, fractional matching and factors of graphs with given minimum degree
by: Xu, Zengzhao, et al.
Published: (2023)

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

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

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

Sufficient conditions for a graph with minimum degree to be k-critical with respect to [1,b]-odd factor
by: Zhou, Sizhong
Published: (2025)

Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
by: Krone, Maximilian
Published: (2025)

Cycle lengths in graphs of given minimum degree
by: Bai, Yandong, et al.
Published: (2025)

Tight minimum degree conditions for apex-outerplanar minors and subdivisions in graphs and digraphs
by: Liu, Chun-Hung, et al.
Published: (2024)

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

The minimum size of a chordal graph with given order and minimum degree
by: Zhan, Xingzhi, et al.
Published: (2024)

Embedding trees using minimum and maximum degree conditions
by: Pokrovskiy, Alexey, et al.
Published: (2025)

Bipartite graphs with minimum degree at least 15 are antimagic
by: Deng, Kecai
Published: (2025)

Building graphs with high minimum degree on a budget
by: Katsamaktsis, Kyriakos, et al.
Published: (2024)

Compatible Hamilton cycles in graphs with large minimum degree
by: Behague, Natalie, et al.
Published: (2026)

Generalized graph codes and thier minimum distances
by: Fujii, Naoki
Published: (2025)

Paired domination in graphs with minimum degree four
by: Bujtás, Csilla, et al.
Published: (2025)

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

On the isolation number of graphs with minimum degree four
by: Goddard, Wayne, et al.
Published: (2025)

Exact minimum co-degree conditions for $\ell$-Hamiltonicity in hypergraphs
by: Gan, Luyining, et al.
Published: (2026)

The circumference of a graph with given minimum degree and clique number
by: Chen, Na, et al.
Published: (2025)

Improved bounds for the minimum degree of minimal multicolor Ramsey graphs
by: Attwa, Yamaan, et al.
Published: (2025)

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

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)

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

Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)

Odd and even cycle lengths, minimum degree and chromatic number in graphs
by: Wang, Xiaolin
Published: (2025)

Arbitrary orientations of Hamilton cycles in directed graphs of large minimum degree
by: DeBiasio, Louis, et al.
Published: (2025)

A strengthening on consecutive odd cycles in graphs of given minimum degree
by: Lin, Hao, et al.
Published: (2024)

Complete tripartite subgraphs of balanced tripartite graphs with large minimum degree
by: Chen, Yihan, et al.
Published: (2024)

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

The spectral degree exponent of a graph
by: Achterberg, Massimo A., et al.
Published: (2025)

Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)

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