Imagen de Portada

Hamiltonian cycles in tough $(P_4 \cup P_1)$-free graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Shan, Songling
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

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

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

On hamiltonian cycles of 1-tough $(P_{2} \cup kP_{1})$-free graphs
por: Sanka, Masahiro
Publicado: (2026)

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

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

Coloring of some $(P_2\cup P_4)$-free graphs
por: Ran, Chen, et al.
Publicado: (2024)

A Fan-type condition for cycles in $1$-tough and $k$-connected $(P_2\cup kP_1)$-free graphs
por: Hu, Zhiquan, et al.
Publicado: (2024)

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)

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

Perfect divisions in ($P_2 \cup P_4$, bull)-free graphs
por: Chen, Lizhong, et al.
Publicado: (2025)

Optimal chromatic bound for ($P_2\cup P_4$, HVN)-free graphs
por: Chen, Lizhong, et al.
Publicado: (2025)

Colouring ($P_2\cup P_4$, diamond)-free graphs with $ω$ colours
por: Wang, Hongyang
Publicado: (2025)

Perfect divisibility of (fork, antifork$\cup K_1$)-free graphs
por: Chen, Ran, et al.
Publicado: (2025)

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

Equitable tree colouring of graphs
por: Gao, Yuping, et al.
Publicado: (2026)

A reduction of the "cycles plus $K_4$'s" problem
por: Dalal, Aseem, et al.
Publicado: (2024)

Towards the Overfull Conjecture
por: Shan, Songling
Publicado: (2023)

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

Vertex-distinguishing and sum-distinguishing edge coloring of regular graphs
por: Gao, Yuping, et al.
Publicado: (2024)

Vertex-distinguishing edge coloring of graphs
por: Gao, Yuping, et al.
Publicado: (2025)

Spanning Euler Tours in Hypergraphs
por: Bahmanian, Amin, et al.
Publicado: (2024)

Linear arboricity of robust expanders
por: Gao, Yuping, et al.
Publicado: (2024)

Graceful Labeling of Two Families of Spiders
por: Shan, Songling, et al.
Publicado: (2026)

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

Total coloring graphs with large maximum degree
por: Dalal, Aseem, et al.
Publicado: (2024)

Coloring some $(P_6,C_4)$-free graphs with $Δ-1$ colors
por: Chen, Ran, et al.
Publicado: (2024)

Reconfiguration graph for vertex colorings for ($P_2$+$P_3$, $C_4$)-free graphs
por: Belavadi, M., et al.
Publicado: (2025)

($P_2+P_4$, $K_4-e$)-free graphs are nearly $ω$-colorable
por: Angeliya, C. U., et al.
Publicado: (2025)

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

Vertex-critical graphs in subfamilies of $(P_4+\ell P_1)$-free graphs
por: Beaton, Iain, et al.
Publicado: (2026)

Vertex-critical $(P_5,\text{chair})$-free and $(P_5,\text{cricket})$-free graphs
por: Jooken, Jorik
Publicado: (2026)

Structure, Perfect Divisibility and Coloring of ($P_2\cup P_4, C_3$)-Free Graphs
por: Chen, Ran, et al.
Publicado: (2025)

The class of $(2P_3,C_4,C_6)$-free graphs, part II: $(2P_3,C_4,C_6,C_7,T_0)$-free graphs
por: Penev, Irena
Publicado: (2025)

On degree power sum in $P_k$-free graphs
por: Ai, Jiangdong, et al.
Publicado: (2024)

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

Secure domination in $P_5$-free graphs
por: Gupta, Uttam K., et al.
Publicado: (2025)

A sufficient condition for a hypergraph to have a Berge-$k$-factor
por: Gao, Yuping, et al.
Publicado: (2023)

Powers of Hamiltonian cycles in randomly augmented Pósa-Seymour graphs
por: Antoniuk, Sylwia, et al.
Publicado: (2025)

The class of $(2P_3,C_4,C_6)$-free graphs, part I: $(2P_3,C_4,C_6)$-free graphs that contain an induced $C_7$ or an induced $T_0$
por: Penev, Irena
Publicado: (2025)