Paths of low weight in planar graphs

DOI10.7151/DMGT.1396MaRDI QIDQ3527531zbMATH OpenOpenAlexFDO

Authors Igor Fabrici, Jochen Harant, Stanislav Jendroľ

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 graphspolytopal graphsweight of an edgeweight of path

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1002024
• Lightweight paths in graphs
• On the path-width of planar graphs
• Planar graphs, negative weight edges, shortest paths, and near linear time
• Pathwidth of planar and line graphs
• Paths with restricted degrees of their vertices in planar graphs
• scientific article; zbMATH DE number 3954891
• Path choosability of planar graphs
• On shortest disjoint paths in planar graphs
• On shortest disjoint paths in planar graphs

Cited in

(8)

• On the existence of specific stars in planar graphs
• Note on the weight of paths in plane triangulations of minimum degree 4 and 5
• Lightweight paths in graphs
• On longest cycles in essentially 4-connected planar graphs
• Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
• Four gravity results
• Light graphs in families of outerplanar graphs
• Weight of 3-paths in sparse plane graphs

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

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