:: Library Catalog

Cover Image

Saved in:

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

Similar Items

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

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

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

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

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

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

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

A construction of a $\frac{3}{2}$-tough plane triangulation with no 2-factor
by: Shan, Songling
Published: (2022)

2-factors in $\frac{3}{2}$-tough maximal planar graphs
by: Hao, Lili, 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)

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

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

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

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

Equitable tree colouring of graphs
by: Gao, Yuping, et al.
Published: (2026)

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

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

Towards the Overfull Conjecture
by: Shan, Songling
Published: (2023)

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

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

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

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

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

Spanning Euler Tours in Hypergraphs
by: Bahmanian, Amin, et al.
Published: (2024)

Linear arboricity of robust expanders
by: Gao, Yuping, et al.
Published: (2024)

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

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

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

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

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

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

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

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

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

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

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
by: Penev, Irena
Published: (2025)

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

Cliques and High Odd Holes in Graphs with Chromatic Number Equal to Maximum Degree
by: Galindo, Rachel, et al.
Published: (2025)

Degree sequences realizing labelled perfect matchings
by: Briggs, Joseph, et al.
Published: (2025)

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