On the existence of a long path between specified vertices in a 2-connected graph

DOI10.1007/PL00007222MaRDI QIDQ1586580zbMATH OpenOpenAlexFDO

Authors Kazuhide Hirohata

Publication date 14 November 2000

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/pl00007222

zbMATH Keywords

2-connected graphmaximum degreepath

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• Fan-type theorem for a long path passing through a specified vertex
• Long paths through four vertices in a 2-connected graph
• Long paths and cycles through specified vertices in k-connected graphs.
• Long paths through specified vertices in \(3\)-connected graphs
• scientific article; zbMATH DE number 2201389

Cited in

(7)

• Ore-type degree condition for heavy paths in weighted graphs
• Fan-type theorem for a long path passing through a specified vertex
• scientific article; zbMATH DE number 4204377 (Why is no real title available?)
• scientific article; zbMATH DE number 3929041 (Why is no real title available?)
• Long paths through four vertices in a 2-connected graph
• scientific article; zbMATH DE number 2201389 (Why is no real title available?)
• Long paths through specified vertices in \(3\)-connected graphs

This page was built for publication: On the existence of a long path between specified 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 Q1586580)