Circumference of a graph and its distance dominating longest cycles
From MaRDI portal
Publication:2214043
DOI10.1016/j.disc.2020.112196zbMath1454.05083OpenAlexW3097378511MaRDI QIDQ2214043
Publication date: 4 December 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.112196
Paths and cycles (05C38) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large cycles in 4-connected graphs
- A degree sum condition with connectivity for relative length of longest paths and cycles
- A sufficient condition for dominating cycles
- A note on distance-dominating cycles
- Existence of dominating cycles and paths
- Equivalence of Fleischner's and Thomassen's conjectures
- Forbidden pairs and the existence of a dominating cycle
- A note on Hamiltonian circuits
- Existence of Δλ-cycles and Δλ-paths
- Some Theorems on Abstract Graphs
This page was built for publication: Circumference of a graph and its distance dominating longest cycles