On the Intersections of Longest Cycles in a Graph
From MaRDI portal
Recommendations
- Intersections of longest cycles in \(k\)-connected graphs
- scientific article; zbMATH DE number 3875324
- On a question of van Aardt et al. on destroying all longest cycles
- Transversals of longest cycles in partial k‐trees and chordal graphs
- The longest cycles in a graph G with minimum degree at least \(| G| /k\)
Cites work
Cited in
(15)- Intersections of largest bonds in \(k\)-connected graphs
- On the length of longest dominating cycles in graphs
- Intersections of longest cycles in \(k\)-connected graphs
- On a question of van Aardt et al. on destroying all longest cycles
- The longest cycle problem is polynomial on interval graphs
- Intersection of longest paths in a graph
- scientific article; zbMATH DE number 3875324 (Why is no real title available?)
- Determinants and Longest Cycles of Graphs
- Geometric Intersection Graphs: Do Short Cycles Help?
- On longest cycles and strongly linking vertex sets
- Intersections of longest cycles in grid graphs
- Transversals of longest cycles in partial k‐trees and chordal graphs
- On two conjectures about the intersection of longest paths and cycles
- Intersection of cycles and paths in k-connected graphs
- Longest cycles in vertex-transitive and highly connected graphs
This page was built for publication: On the Intersections of Longest Cycles in a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4867492)
