Cycle traversability for claw-free graphs and polyhedral maps
From MaRDI portal
Publication:2216923
DOI10.1007/s00493-019-4042-zzbMath1463.05302arXiv1803.04466OpenAlexW3009391173MaRDI QIDQ2216923
Xiaoya Zha, Dong Ye, Michael D. Plummer, Ervin Gyoeri
Publication date: 18 December 2020
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1803.04466
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A twelve vertex theorem for 3-connected claw-free graphs
- Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs
- A look at cycles containing specified elements of a graph
- When m vertices in a k-connected graph cannot be walked round along a simple cycle
- A nine point theorem for 3-connected graphs
- Circuits through specified edges
- Cycles through specified vertices of a graph
- Circuits containing specified edges
- 4-connected projective planar graphs are Hamiltonian
- Claw-free graphs---a survey
- Cycles through a prescribed vertex set in \(n\)-connected graphs.
- One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
- Cycles through ten vertices in 3-connected cubic graphs
- Applications of Menger's graph theorem
- Zur Theorie der n-fach zusammenhängenden Graphen
- Circuits and paths through specified nodes
- A Theorem on Planar Graphs
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- Hamiltonian results inK1,3-free graphs
- Cycles Through Prescribed and Forbidden Point Sets
- Circuits through prescribed vertices in k‐connected k‐regular graphs
- A nine vertex theorem for 3-connected claw- free graphs
- Cycles and Connectivity in Graphs
- On Cycles and Connectivity in Planar Graphs
This page was built for publication: Cycle traversability for claw-free graphs and polyhedral maps
