Note on weights of paths in polyhedral graphs

DOI10.1016/S0012-365X(99)00052-7MaRDI QIDQ1301673zbMATH OpenWikidataFDO

Authors 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)

Recommendations

• On the weights of simple paths in weighted complete graphs
• Note on the weight of paths in plane triangulations of minimum degree 4 and 5
• scientific article; zbMATH DE number 12050
• Path ideals of weighted graphs
• Path covers of weighted graphs
• scientific article; zbMATH DE number 10422
• Heavy paths and cycles in weighted graphs
• Path weights in concentration graphs
• Some results on graph parameters in weighted graphs

Cites work

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

Cited in

(2)

• Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
• On the weights of simple paths in weighted complete graphs

This page was built for publication: Note on weights of paths in polyhedral graphs

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