Long paths through specified vertices in 3-connected graphs

DOI10.1007/B11261MaRDI QIDQ5897109zbMATH OpenOpenAlexFDO

Authors Toshinori Sakai

Publication date 5 February 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Long paths and cycles through specified vertices in k-connected graphs.
• Long paths and cycles passing through specified vertices under the average degree condition
• Long paths through four vertices in a 2-connected graph
• On the existence of a long path between specified vertices in a 2-connected graph
• Cycles and paths through specified vertices in k-connected graphs

Cited in

(10)

• Extremal 3-connected graphs
• Long path connectivity of regular graphs
• On the existence of a long path between specified vertices in a 2-connected graph
• A new approach towards a conjecture on intersecting three longest paths
• Long paths and cycles through specified vertices in k-connected graphs.
• scientific article; zbMATH DE number 3929041 (Why is no real title available?)
• A Mengerian theorem for paths of length at least three
• Long paths through four vertices in a 2-connected graph
• Long paths and cycles passing through specified vertices under the average degree condition
• Long paths with endpoints in given vertex-subsets of graphs

This page was built for publication: Long paths through specified vertices in \(3\)-connected graphs

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