Cover Image

Every $3$-connected $\{K_{1,3},Γ_3\}$-free graph is Hamilton-connected

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kabela, Adam, Ryjáček, Zdeněk, Skyvová, Mária, Vrána, Petr
Format:	Preprint
Published:	2024
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A closure for Hamilton-connectedness in $\{K_{1,3},Γ_3\}$-free graphs
by: Kabela, Adam, et al.
Published: (2024)

Equivalent formulation of Thomassen's conjecture using Tutte paths in claw-free graphs
by: Kabela, Adam, et al.
Published: (2019)

Every 3-connected $\{K_{1,4},K_{1,4}+e\}$-free split graph of order at least 13 is Hamilton-connected
by: Tian, Tao, et al.
Published: (2026)

Hamiltonicity and structure of connected biclaw-free graphs
by: Pokrovskiy, Alexey, et al.
Published: (2025)

Characterization of $P_3$-connected graphs
by: Chen, Rong
Published: (2025)

Super-minimally $3$-connected graphs
by: Ge, Wayne
Published: (2025)

Every connected subcubic graph except the Petersen graph is packing $(1,1,2,2)$-colorable
by: Hou, Xinmin, et al.
Published: (2026)

Detachable pairs in $3$-connected matroids and simple $3$-connected graphs
by: Brettell, Nick, et al.
Published: (2024)

The $K_{1,2}$-structure-connectivity of graphs
by: Zhao, Xiao, et al.
Published: (2024)

On the pancyclicity of $2$-connected $[5,3]$-graphs
by: Liu, Feng, et al.
Published: (2025)

3-path-connectivity of Cayley graphs generated by wheel graphs
by: Luo, Yi-Lu, 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)

Every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian
by: Shao, Sihong, et al.
Published: (2025)

3-path-connectivity of bubble-sort star graphs
by: Luo, Yi-Lu, et al.
Published: (2025)

Realizing degree sequences with $\mathcal S_3$-connected graphs
by: Guan, Rui, et al.
Published: (2025)

The 3-restricted edge-connectivity of the direct product graphs
by: Wang, Wenxin, et al.
Published: (2025)

On 2-connected graphs without cycles of length 1 modulo 3
by: Bai, Yandong, et al.
Published: (2026)

4-connected 1-planar chordal graphs are Hamiltonian-connected
by: Zhang, Licheng, et al.
Published: (2024)

Tight spectral conditions for the Hamiltonicity of $K_{1,r}$-free split graphs
by: Cai, Yiting, et al.
Published: (2026)

Digraphons: connectivity and spectral aspects
by: Hladký, Jan, et al.
Published: (2025)

Connectivity keeping trees in 3-connected bipartite graphs with girth conditions
by: Yang, Qing, et al.
Published: (2023)

The number of cut-edges and conflict-free connection number in planar graphs
by: Ha, Pham Hoang, et al.
Published: (2026)

Every connected graph admits a local antimagic orientation and almost every graph admits an antimagic orientation
by: Dhananjaya, Eranda, et al.
Published: (2024)

Every subcubic graph is packing $(1,1,2,2,3)$-colorable
by: Liu, Xujun, et al.
Published: (2024)

Monochromatic $k$-connection of graphs
by: Cai, Qingqiong, et al.
Published: (2024)

The 3-path-connectivity of the augmented cubes
by: Kandekar, S. A., et al.
Published: (2025)

A unified approach to the spectral radius, connectivity and edge-connectivity of graphs
by: Wang, Yu, et al.
Published: (2024)

Sparsity of 3-flow critical graphs
by: Dvořák, Zdeněk, et al.
Published: (2024)

Spectral Turán problem for $\mathcal{K}_{3,3}^{-}$-free signed graphs
by: Qin, Mingsong, et al.
Published: (2025)

Nowhere-zero 8-flows in 3-edge-connected signed graphs
by: DeVos, Matt, et al.
Published: (2025)

Properties of uniformly $3$-connected graphs
by: Göring, Frank, et al.
Published: (2022)

Cycles of consecutive lengths in $3$-connected graphs
by: Li, Chengli, et al.
Published: (2025)

A note on highly connected $K_{2,\ell}$-minor free graphs
by: Bousquet, Nicolas, et al.
Published: (2023)

The generalized 4-connectivity of godan graphs
by: Wang, Jing, et al.
Published: (2024)

Essential connectivity and spectral radius of graphs
by: Ding, Wenxiu, et al.
Published: (2024)

The number of dissociation sets in connected graphs
by: Yuan, Bo-Jun, et al.
Published: (2024)

A note on connectivity in directed graphs
by: Stylianou, Stelios
Published: (2024)

Decomposable polymatroids and connections with graph coloring
by: Bonin, Joseph E., et al.
Published: (2019)

Proof a conjecture on connectivity keeping odd paths in k-connected bipartite graphs
by: Yang, Qing, et al.
Published: (2022)

11/4-colorability of subcubic triangle-free graphs
by: Dvořák, Zdeněk, et al.
Published: (2022)