Relative length of longest paths and cycles in 2-connected graphs
From MaRDI portal
Recommendations
- Relative length of longest paths and cycles in 3-connected graphs
- Longest paths and longest cycles in graphs with large degree sums
- Degree conditions and relative length of longest paths and cycles in graphs
- Length of longest cycles in a graph whose relative length is at least two
- A note on dominating cycles in 2-connected graphs
Cited in
(15)- Bounding the distance among longest paths in a connected graph
- Graphs with almost all edges in long cycles
- Longest paths and longest cycles in graphs with large degree sums
- Characterizing forbidden pairs for relative length of longest paths and cycles
- The longest cycle problem is polynomial on interval graphs
- Relative length of longest paths and longest cycles in triangle-free graphs
- Relative length of longest paths and cycles in 3-connected graphs
- scientific article; zbMATH DE number 4204377 (Why is no real title available?)
- scientific article; zbMATH DE number 4162913 (Why is no real title available?)
- scientific article; zbMATH DE number 1112756 (Why is no real title available?)
- Longest path starting at a vertex
- Long dominating cycles in graphs
- The ratio of the longest cycle and longest path in semicomplete multipartite digraphs
- Edge-diameter of a graph and its longest cycles
- Algorithm for two disjoint long paths in 2-connected graphs
This page was built for publication: Relative length of longest paths and cycles in 2-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3583298)
