Saved in:
| Main Authors: | Kabela, Adam, Ryjáček, Zdeněk, Skyvová, Mária, Vrána, Petr |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.03036 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Every $3$-connected $\{K_{1,3},Γ_3\}$-free graph is Hamilton-connected
by: Kabela, Adam, et al.
Published: (2024)
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)
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)
by: Tian, Tao, et al.
Published: (2026)
Tight spectral conditions for the Hamiltonicity of $K_{1,r}$-free split graphs
by: Cai, Yiting, et al.
Published: (2026)
by: Cai, Yiting, et al.
Published: (2026)
Computing equivalence classes of finite group actions on orientable surfaces: A dynamic survey
by: Karabáš, Ján, et al.
Published: (2022)
by: Karabáš, Ján, et al.
Published: (2022)
11/4-colorability of subcubic triangle-free graphs
by: Dvořák, Zdeněk, et al.
Published: (2022)
by: Dvořák, Zdeněk, et al.
Published: (2022)
Structure and generation of crossing-critical graphs
by: Dvořák, Zdeněk, et al.
Published: (2018)
by: Dvořák, Zdeněk, et al.
Published: (2018)
Sparsity of 3-flow critical graphs
by: Dvořák, Zdeněk, et al.
Published: (2024)
by: Dvořák, Zdeněk, et al.
Published: (2024)
A Max-Min problem on spectral radius and connectedness of graphs
by: Lou, Zhenzhen, et al.
Published: (2025)
by: Lou, Zhenzhen, et al.
Published: (2025)
Hamilton cycles in tough $(2P_2 \cup P_1)$-free graphs
by: Shan, Songling, et al.
Published: (2025)
by: Shan, Songling, et al.
Published: (2025)
Spectral Turán problem for $\mathcal{K}_{3,3}^{-}$-free signed graphs
by: Qin, Mingsong, et al.
Published: (2025)
by: Qin, Mingsong, et al.
Published: (2025)
Hamiltonicity and structure of connected biclaw-free graphs
by: Pokrovskiy, Alexey, et al.
Published: (2025)
by: Pokrovskiy, Alexey, et al.
Published: (2025)
On some classes of cycles-related $Γ$-harmonious graphs
by: Agrahari, Gyaneshwar, et al.
Published: (2024)
by: Agrahari, Gyaneshwar, et al.
Published: (2024)
Odd clique minors and chromatic bounds of {3$K_1$, paraglider}-free graphs
by: Ji, Yuqing, et al.
Published: (2025)
by: Ji, Yuqing, et al.
Published: (2025)
$K_{2,t+1}$-free graphs with many copies of $K_{t,t}$
by: Pohoata, Cosmin, et al.
Published: (2026)
by: Pohoata, Cosmin, et al.
Published: (2026)
4K_1 free graphs on 13 vertices have cop number at most 2
by: Wu, Zhaoyu
Published: (2026)
by: Wu, Zhaoyu
Published: (2026)
The Hamilton space of pseudorandom graphs
by: Christoph, Micha, et al.
Published: (2024)
by: Christoph, Micha, et al.
Published: (2024)
Hamiltonicity of Cartesian products of graphs
by: Ladinek, Irena Hrastnik, et al.
Published: (2024)
by: Ladinek, Irena Hrastnik, et al.
Published: (2024)
Hamiltonicity of inhomogeneous random graphs
by: Garbe, Frederik, et al.
Published: (2026)
by: Garbe, Frederik, et al.
Published: (2026)
Hamiltonicity of covering graphs of trees
by: Bradshaw, Peter, et al.
Published: (2022)
by: Bradshaw, Peter, et al.
Published: (2022)
$4K_1$-free graph with the cop number $3$
by: Char, Arnab, et al.
Published: (2025)
by: Char, Arnab, et al.
Published: (2025)
The connectedness of friends-and-strangers graphs about graph parameters and others
by: Zhao, Xinghui, et al.
Published: (2025)
by: Zhao, Xinghui, et al.
Published: (2025)
On the Hamiltonicity, traceability and toughness of complements of line graphs
by: Mammoliti, Adam
Published: (2026)
by: Mammoliti, Adam
Published: (2026)
Asymptotic probability for connectedness
by: Monteil, Thierry, et al.
Published: (2024)
by: Monteil, Thierry, et al.
Published: (2024)
On the strength of connectedness of unions of random graphs
by: Bloznelis, Mindaugas
Published: (2026)
by: Bloznelis, Mindaugas
Published: (2026)
The Hamilton cycle space of random graphs
by: Hefetz, Dan, et al.
Published: (2025)
by: Hefetz, Dan, et al.
Published: (2025)
Robust Hamiltonicity in families of Dirac graphs
by: Anastos, Michael, et al.
Published: (2023)
by: Anastos, Michael, et al.
Published: (2023)
Colorful Hamilton cycles in random graphs
by: Chakraborti, Debsoumya, et al.
Published: (2021)
by: Chakraborti, Debsoumya, et al.
Published: (2021)
Graphs that admit a Hamilton path are cup-stackable
by: Gregor, Petr, et al.
Published: (2024)
by: Gregor, Petr, et al.
Published: (2024)
Hamiltonicity of Schrijver graphs and stable Kneser graphs
by: Mütze, Torsten, et al.
Published: (2024)
by: Mütze, Torsten, et al.
Published: (2024)
Colour-biased Hamilton cycles in dense graphs and random graphs
by: Behague, Natalie, et al.
Published: (2025)
by: Behague, Natalie, et al.
Published: (2025)
Maximum spread of $K_{s,t}$-minor-free graphs
by: Linz, William, et al.
Published: (2024)
by: Linz, William, et al.
Published: (2024)
Generalized Petersen graphs are (1,3)-choosable
by: Tang, Yunfang, et al.
Published: (2024)
by: Tang, Yunfang, et al.
Published: (2024)
Degree sequence condition for Hamiltonicity in tough graphs
by: Shan, Songling, et al.
Published: (2024)
by: Shan, Songling, et al.
Published: (2024)
Near rainbow Hamilton cycles in dense graphs
by: Peng, Danni, et al.
Published: (2024)
by: Peng, Danni, et al.
Published: (2024)
Powers of Hamilton cycles in oriented and directed graphs
by: DeBiasio, Louis, et al.
Published: (2024)
by: DeBiasio, Louis, et al.
Published: (2024)
The completion numbers of Hamiltonicity and pancyclicity in random graphs
by: Alon, Yahav, et al.
Published: (2023)
by: Alon, Yahav, et al.
Published: (2023)
Dirac-type condition for Hamilton-generated graphs
by: Hou, Xinmin, et al.
Published: (2025)
by: Hou, Xinmin, et al.
Published: (2025)
Hitting time for Hamilton cycles in pseudorandom graphs
by: Chen, Yaobin, et al.
Published: (2026)
by: Chen, Yaobin, et al.
Published: (2026)
Perfect divisibility of (fork, antifork$\cup K_1$)-free graphs
by: Chen, Ran, et al.
Published: (2025)
by: Chen, Ran, et al.
Published: (2025)
Similar Items
-
Every $3$-connected $\{K_{1,3},Γ_3\}$-free graph is Hamilton-connected
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) -
Tight spectral conditions for the Hamiltonicity of $K_{1,r}$-free split graphs
by: Cai, Yiting, et al.
Published: (2026) -
Computing equivalence classes of finite group actions on orientable surfaces: A dynamic survey
by: Karabáš, Ján, et al.
Published: (2022)