Long induced paths in 3-connected planar graphs

DOI10.7151/DMGT.1110MaRDI QIDQ4522464zbMATH OpenOpenAlexFDO

Authors Pilar Valencia, Jorge L. Arocha

Publication date 10 May 2001

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1110

zbMATH Keywords

3-connected planar graphsembeddinglong path

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Lower and upper bounds for long induced paths in 3-connected planar graphs
• Lower and upper bounds for long induced paths in 3-connected planar graphs
• Long induced paths in graphs
• Long cycles in 3-connected graphs
• On vertex-degree restricted paths in polyhedral graphs

Cited in

(8)

• Long induced paths in minor-closed graph classes and beyond
• Lower and upper bounds for long induced paths in 3-connected planar graphs
• Lower and upper bounds for long induced paths in 3-connected planar graphs
• Long induced paths in graphs
• Schnyder Woods and long induced paths in 3-connected planar graphs
• Long induced paths and forbidden patterns: polylogarithmic bounds
• Graph theory. Abstracts from the workshop held January 5--10, 2025
• Treedepth and 2-treedepth in graphs with no long induced paths

This page was built for publication: Long induced paths in 3-connected planar graphs

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