Edge-dominating cycles, k-walks and Hamilton prisms in 2K2-free graphs

DOI10.1142/S0218216516420116zbMath1351.05174arXiv1412.0514OpenAlexW2213590585WikidataQ56859900 ScholiaQ56859900MaRDI QIDQ2835378

Gao Mou, Dimitrii V. Pasechnik

Publication date: 2 December 2016

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.0514

zbMATH Keywords

\(k\)-walkprism-Hamiltonicity\(2K_2\)-free graphs\(t\)-tough graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Spanning trails with maximum degree at most 4 in \(2K_2\)-free graphs ⋮ Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs

Cites Work

• Algorithmic graph theory and perfect graphs
• Tough graphs and Hamiltonian circuits.
• Unnamed Item

This page was built for publication: Edge-dominating cycles, k-walks and Hamilton prisms in 2K2-free graphs