2-walks in 2-tough 2k2-free graphs
Combinatorics
2014-09-11 v3
Authors:
Gao Mou
Abstract
In this paper, we prove that in every 2-tough 2K2-free graph, there is a 2-walk.
Cite
@article{arxiv.1408.3380,
title = {2-walks in 2-tough 2k2-free graphs},
author = {Gao Mou},
journal= {arXiv preprint arXiv:1408.3380},
year = {2014}
}
Related papers
View all related →
Combinatorics · Mathematics
Hamiltonian cycles in 2-tough $2K_2$-free graphs
Katsuhiro Ota, Masahiro Sanka
2021-12-06
Combinatorics · Mathematics
Existence of $2$-Factors in Tough Graphs without Forbidden Subgraphs
Elizabeth Grimm, Songling Shan, Anna Johnsen
2022-04-08
Combinatorics · Mathematics
One-way infinite 2-walks in planar graphs
Daniel P. Biebighauser, M. N. Ellingham
2015-08-28
Combinatorics · Mathematics
Edge-dominating cycles, k-walks and Hamilton prisms in $2K_2$-free graphs
Gao Mou, Dmitrii Pasechnik
2017-07-05
Combinatorics · Mathematics
Hamiltonian cycles in 3-tough $2K_2$-free graphs
Songling Shan
2017-06-29
Combinatorics · Mathematics
Forbidden subgraphs and 2-factors in 3/2-tough graphs
Masahiro Sanka
2022-08-24
Combinatorics · Mathematics
Nonempty intersection of longest paths in $2K_2$-free graphs
Gili Golan, Songling Shan
2016-11-21
Combinatorics · Mathematics
Spanning trails with maximum degree at most 4 in $2K_2$-free graphs
Guantao Chen, M. N. Ellingham, Akira Saito, Songling Shan
2016-09-29
Combinatorics · Mathematics
2-factors in $\frac{3}{2}$-tough maximal planar graphs
Lili Hao, Hui Ma, Songling Shan, Weihua Yang
2025-07-02
Combinatorics · Mathematics
Cop number of $2K_2$-free graphs
Vaidy Sivaraman, Stephen Testa
2019-03-28
Combinatorics · Mathematics
2-Factors in Graphs
Jan van den Heuvel, Bjarne Toft
2026-05-08
Combinatorics · Mathematics
Some conditions for hamiltonian cycles in 1-tough $(K_2 \cup kK_1)$-free graphs
Katsuhiro Ota, Masahiro Sanka
2023-02-22
Combinatorics · Mathematics
Every $2k$-connected $(P_2\cup kP_1)$-free graph with toughness greater than one is hamiltonian-connected
Feng Liu
2025-03-18
Combinatorics · Mathematics
Toughness and prism-hamiltonicity of $P_4$-free graphs
M. N. Ellingham, Pouria Salehi Nowbandegani, Songling Shan
2019-01-08
Combinatorics · Mathematics
Hamiltonicity of 3-tough $(K_2 \cup 3K_1)$-free graphs
Andrew Hatfield, Elizabeth Grimm
2021-06-15
Combinatorics · Mathematics
Graph Labelings Obtainable by Random Walks
Sela Fried, Toufik Mansour
2023-04-13
Combinatorics · Mathematics
A Stability Theorem for Maximal $C_{2k+1}$-free Graphs
Jian Wang, Shipeng Wang, Weihua Yang, Xiaoli Yuan
2021-06-09
Combinatorics · Mathematics
On heavy paths in 2-connected weighted graphs
Binlong Li, Shenggui Zhang
2011-11-28
Combinatorics · Mathematics
2-walk-regular dihedrants from group-divisible designs
Zhi Qiao, Shao Fei Du, Jack H. Koolen
2015-04-03
Combinatorics · Mathematics
A simple proof of the existence of complete bipartite graph immersion in graphs with independence number two
Rong Chen, Zijian Deng
2024-12-09
Combinatorics · Mathematics
Cops and robbers on $2K_2$-free graphs
Jérémie Turcotte
2025-10-29
Combinatorics · Mathematics
Hamiltonian cycles in $ 15 $-tough ($ P_{3}\cup 3P_{1} $)-free graphs
Hui Ma, Lili Hao, Weihua Yang
2025-07-04
Data Structures and Algorithms · Computer Science
On the Two Paths Theorem and the Two Disjoint Paths Problem
Samuel Humeau, Damien Pous
2025-08-15
Combinatorics · Mathematics
Toughness and existence of $2$-factors
Leyou Xu, Bo Zhou
2023-10-17
Combinatorics · Mathematics
Geometric aspects of 2-walk-regular graphs
Marc Cámara, Edwin R. van Dam, Jack H. Koolen, Jongyook Park
2015-11-25