Long paths through four vertices in a 2-connected graph

DOI10.1002/(SICI)1097-0118(200002)33:2%3C55::AID-JGT1%3E3.0.CO;2-SMaRDI QIDQ4946542zbMATH OpenOpenAlexFDO

Authors Mark V. Barovich

Publication date 7 June 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(200002)33:2%3C55::aid-jgt1%3E3.0.co;2-s

zbMATH Keywords

\(2\)-connected graphlong path

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• On the existence of a long path between specified vertices in a 2-connected graph
• Long path connectivity of regular graphs
• Long paths and cycles through specified vertices in k-connected graphs.
• Long paths through specified vertices in \(3\)-connected graphs
• Fan-type theorem for a long path passing through a specified vertex

Cited in

(8)

• On the existence of a long path between specified vertices in a 2-connected graph
• Long paths and cycles through specified vertices in k-connected graphs.
• scientific article; zbMATH DE number 3929041 (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 paths through specified vertices in \(3\)-connected graphs
• Graph of \(uv\)-paths in connected graphs
• Algorithm for two disjoint long paths in 2-connected graphs

This page was built for publication: Long paths through four vertices in a 2-connected graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4946542)