2-walks in 2-tough 2k2-free graphs
classification
🧮 math.CO
keywords
tougheveryfreegraphgraphsk2-freeprovethere
read the original abstract
In this paper, we prove that in every 2-tough 2$K_2$-free graph, there is a 2-walk.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.