Degree sequence condition for Hamiltonicity in tough graphs
Fuente:
arXiv
Guardado en:
| Autores principales: | Shan, Songling, Tanyel, Arthur |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
A strengthening of a degree sequence condition for Hamiltonicity in tough graphs
por: Shan, Songling, et al.
Publicado: (2025)
por: Shan, Songling, et al.
Publicado: (2025)
Hamilton cycles in tough $(2P_2 \cup P_1)$-free graphs
por: Shan, Songling, et al.
Publicado: (2025)
por: Shan, Songling, et al.
Publicado: (2025)
Hamiltonian cycles in tough $(P_4 \cup P_1)$-free graphs
por: Shan, Songling
Publicado: (2025)
por: Shan, Songling
Publicado: (2025)
A construction of a $\frac{3}{2}$-tough plane triangulation with no 2-factor
por: Shan, Songling
Publicado: (2022)
por: Shan, Songling
Publicado: (2022)
2-factors in $\frac{3}{2}$-tough maximal planar graphs
por: Hao, Lili, et al.
Publicado: (2025)
por: Hao, Lili, et al.
Publicado: (2025)
Degree sequences realizing labelled perfect matchings
por: Briggs, Joseph, et al.
Publicado: (2025)
por: Briggs, Joseph, et al.
Publicado: (2025)
A spectral condition for Hamilton cycles in tough bipartite graphs
por: Ai, Lianyang, et al.
Publicado: (2025)
por: Ai, Lianyang, et al.
Publicado: (2025)
Cliques and High Odd Holes in Graphs with Chromatic Number Equal to Maximum Degree
por: Galindo, Rachel, et al.
Publicado: (2025)
por: Galindo, Rachel, et al.
Publicado: (2025)
Equitable tree colouring of graphs
por: Gao, Yuping, et al.
Publicado: (2026)
por: Gao, Yuping, et al.
Publicado: (2026)
Towards the Overfull Conjecture
por: Shan, Songling
Publicado: (2023)
por: Shan, Songling
Publicado: (2023)
Vertex-distinguishing and sum-distinguishing edge coloring of regular graphs
por: Gao, Yuping, et al.
Publicado: (2024)
por: Gao, Yuping, et al.
Publicado: (2024)
On the Hamiltonicity, traceability and toughness of complements of line graphs
por: Mammoliti, Adam
Publicado: (2026)
por: Mammoliti, Adam
Publicado: (2026)
Sufficient conditions for spanning $k$-trees in tough graphs
por: Jia, Caili, et al.
Publicado: (2026)
por: Jia, Caili, et al.
Publicado: (2026)
Sufficient conditions for $t$-tough graphs to be Hamiltonian and pancyclic or bipartite
por: Liu, Xiangge, et al.
Publicado: (2025)
por: Liu, Xiangge, et al.
Publicado: (2025)
A sufficient condition for a hypergraph to have a Berge-$k$-factor
por: Gao, Yuping, et al.
Publicado: (2023)
por: Gao, Yuping, et al.
Publicado: (2023)
Vertex-distinguishing edge coloring of graphs
por: Gao, Yuping, et al.
Publicado: (2025)
por: Gao, Yuping, et al.
Publicado: (2025)
Dirac-type condition for Hamilton-generated graphs
por: Hou, Xinmin, et al.
Publicado: (2025)
por: Hou, Xinmin, et al.
Publicado: (2025)
Spanning Euler Tours in Hypergraphs
por: Bahmanian, Amin, et al.
Publicado: (2024)
por: Bahmanian, Amin, et al.
Publicado: (2024)
Linear arboricity of robust expanders
por: Gao, Yuping, et al.
Publicado: (2024)
por: Gao, Yuping, et al.
Publicado: (2024)
Graceful Labeling of Two Families of Spiders
por: Shan, Songling, et al.
Publicado: (2026)
por: Shan, Songling, et al.
Publicado: (2026)
Total coloring graphs with large maximum degree
por: Dalal, Aseem, et al.
Publicado: (2024)
por: Dalal, Aseem, et al.
Publicado: (2024)
Total coloring graphs with large minimum degree
por: Henderschedt, Owen, et al.
Publicado: (2025)
por: Henderschedt, Owen, et al.
Publicado: (2025)
Sufficient conditions for the variation of toughness under the distance spectral in graphs involving minimum degree
por: Li, Peishan
Publicado: (2025)
por: Li, Peishan
Publicado: (2025)
Constructions of minimally $t$-tough regular graphs
por: Cheng, Kun, et al.
Publicado: (2024)
por: Cheng, Kun, et al.
Publicado: (2024)
An exact Ore-degree condition for Hamilton cycles in oriented graphs
por: Chang, Yulin, et al.
Publicado: (2025)
por: Chang, Yulin, et al.
Publicado: (2025)
Spectral conditions of pancyclicity for t-tough graphs
por: Benediktovich, Vladimir I.
Publicado: (2024)
por: Benediktovich, Vladimir I.
Publicado: (2024)
Tight spectral conditions for the Hamiltonicity of $K_{1,r}$-free split graphs
por: Cai, Yiting, et al.
Publicado: (2026)
por: Cai, Yiting, et al.
Publicado: (2026)
Minimal toughness in special graph classes
por: Katona, Gyula Y., et al.
Publicado: (2018)
por: Katona, Gyula Y., et al.
Publicado: (2018)
The Hamilton space of pseudorandom graphs
por: Christoph, Micha, et al.
Publicado: (2024)
por: Christoph, Micha, et al.
Publicado: (2024)
Hamiltonicity of Cartesian products of graphs
por: Ladinek, Irena Hrastnik, et al.
Publicado: (2024)
por: Ladinek, Irena Hrastnik, et al.
Publicado: (2024)
Hamiltonicity of inhomogeneous random graphs
por: Garbe, Frederik, et al.
Publicado: (2026)
por: Garbe, Frederik, et al.
Publicado: (2026)
Hamiltonicity of covering graphs of trees
por: Bradshaw, Peter, et al.
Publicado: (2022)
por: Bradshaw, Peter, et al.
Publicado: (2022)
Eigenvalues, edge-disjoint perfect matchings and toughness of regular graphs
por: Zhang, Wenqian
Publicado: (2024)
por: Zhang, Wenqian
Publicado: (2024)
On the existence of minimally tough graphs having large minimum degrees
por: Hasanvand, Morteza
Publicado: (2025)
por: Hasanvand, Morteza
Publicado: (2025)
Minimally tough series-parallel graphs with toughness at least $1/2$
por: Katona, Gyula Y., et al.
Publicado: (2025)
por: Katona, Gyula Y., et al.
Publicado: (2025)
The Hamilton cycle space of random graphs
por: Hefetz, Dan, et al.
Publicado: (2025)
por: Hefetz, Dan, et al.
Publicado: (2025)
Robust Hamiltonicity in families of Dirac graphs
por: Anastos, Michael, et al.
Publicado: (2023)
por: Anastos, Michael, et al.
Publicado: (2023)
Colorful Hamilton cycles in random graphs
por: Chakraborti, Debsoumya, et al.
Publicado: (2021)
por: Chakraborti, Debsoumya, et al.
Publicado: (2021)
Oriented discrepancy of Hamilton cycles in oriented graphs satisfying Ore-type condition
por: Ai, Jiangdong, et al.
Publicado: (2025)
por: Ai, Jiangdong, et al.
Publicado: (2025)
Pseudo-multifan and Lollipop
por: Cao, Yan, et al.
Publicado: (2021)
por: Cao, Yan, et al.
Publicado: (2021)
Ejemplares similares
-
A strengthening of a degree sequence condition for Hamiltonicity in tough graphs
por: Shan, Songling, et al.
Publicado: (2025) -
Hamilton cycles in tough $(2P_2 \cup P_1)$-free graphs
por: Shan, Songling, et al.
Publicado: (2025) -
Hamiltonian cycles in tough $(P_4 \cup P_1)$-free graphs
por: Shan, Songling
Publicado: (2025) -
A construction of a $\frac{3}{2}$-tough plane triangulation with no 2-factor
por: Shan, Songling
Publicado: (2022) -
2-factors in $\frac{3}{2}$-tough maximal planar graphs
por: Hao, Lili, et al.
Publicado: (2025)