Imagen de Portada

On the existence of minimally tough graphs having large minimum degrees

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Hasanvand, Morteza
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Modulo factors with bounded degrees
por: Hasanvand, Morteza
Publicado: (2022)

Spanning tree-connected subgraphs with small degrees
por: Hasanvand, Morteza
Publicado: (2022)

The List Square Coloring Conjecture fails for bipartite planar graphs and their line graphs
por: Hasanvand, Morteza
Publicado: (2022)

Equitable factorizations of highly edge-connected graphs: complete characterizations
por: Hasanvand, Morteza
Publicado: (2024)

Edge-decompositions of $O(m)$-edge-connected graphs into isomorphic copies of a fixed tree of size $m$
por: Hasanvand, Morteza
Publicado: (2022)

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

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

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

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

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

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

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

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

On the minimum degree of minimal $k$-$\{1,2\}$-factor critical $k$-planar graphs
por: Pereyra, Kevin
Publicado: (2026)

Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree
por: Zhang, Yiran, et al.
Publicado: (2023)

The minimum degree of minimal 2-extendable claw-free graphs
por: Guo, Jing, et al.
Publicado: (2025)

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

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

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

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

Forbidden subgraphs generating a finite set of graphs with minimum degree three and large girth
por: Egawa, Yoshimi, et al.
Publicado: (2024)

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

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

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

A new upper bound on the minimum degree of minimal Ramsey graphs
por: Bishnoi, Anurag, et al.
Publicado: (2022)

Paths with two blocks in oriented graphs of large minimum semi-degree
por: Chen, Bin, et al.
Publicado: (2025)

The minimum degree of minimal $k$-factor-critical claw-free graphs*
por: Guo, Jing, et al.
Publicado: (2023)

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

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

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

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

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

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

Which $L$-cospectral graphs have same degree sequences
por: Ye, Jiachang
Publicado: (2024)

Monochromatic cycle partitions of $r$-edge-coloured graphs with high minimum degree
por: Di Braccio, Francesco, et al.
Publicado: (2026)

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

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

The maximum size of a nonhamiltonian-connected graph with given order and minimum degree
por: Zhang, Leilei
Publicado: (2024)

A closure result on spanning $k$-trees of graphs with given minimum degree
por: Zhang, Wenqian
Publicado: (2026)

Adjacent vertices of small degree in minimal matching covered graphs
por: He, Xiaoling, et al.
Publicado: (2026)