Paths of low weight in planar graphs

DOI10.7151/dmgt.1396zbMath1155.05010OpenAlexW2072516858MaRDI QIDQ3527531

Igor Fabrici, Stanlislav Jendroľ, Jochen Harant

Publication date: 29 September 2008

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

Full work available at URL: https://nbn-resolving.org/urn:nbn:de:gbv:ilm1-2020200142

zbMATH Keywords

pathsplanar graphsweight of an edgepolytopal graphsweight of path

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (5)

Light graphs in families of outerplanar graphs ⋮ Lightweight paths in graphs ⋮ On longest cycles in essentially 4-connected planar graphs ⋮ On the existence of specific stars in planar graphs ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27

This page was built for publication: Paths of low weight in planar graphs