Disjoint paths spanning simple polytopal graphs

MaRDI QIDQ3406747zbMATH OpenFDO

Authors Peter Knorr

Publication date 19 February 2010

zbMATH Keywords

spanning subgraphspath traceabilitysimple \(3\)-polytopessimple \(3\)-polytopes spanning subgraphsspanning set of paths

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38)

Recommendations

• scientific article; zbMATH DE number 3920506
• Maximum graphs not spannable by \(r\) disjoint paths
• How many disjoint 2-edge paths must a cubic graph have?
• Disjoint Paths—A Survey
• scientific article; zbMATH DE number 4204383

Cited in

(1)

• Maximal nonrevisiting paths in simple polytopes

This page was built for publication: Disjoint paths spanning simple polytopal graphs

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