Note on weights of paths in polyhedral graphs

DOI10.1016/S0012-365X(99)00052-7zbMath0934.05079WikidataQ127831028 ScholiaQ127831028MaRDI QIDQ1301673

Tomáš Madaras

Publication date: 10 April 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

pathpolyhedral graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items

Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27

Cites Work

• Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
• Subgraphs with restricted degrees of their vertices in planar graphs
• Connected subgraphs with small degree sums in 3-connected planar graphs