scientific article; zbMATH DE number 1536527

MaRDI QIDQ4518401zbMATH OpenFDO

Authors Erhard Hexel, Hansjoachim Walther

Publication date 28 November 2000

zbMATH Keywords

4-connected planar graphslight graphssubgraphs with restricted degree

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)

Recommendations

• Paths with restricted degrees of their vertices in planar graphs
• On vertex-degree restricted paths in polyhedral graphs
• Light paths in 4-connected graphs in the plane and other surfaces
• Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
• Subgraphs with restricted degrees of their vertices in planar graphs

Cited in

(12)

• The maximum sum of degrees above a threshold in planar graphs
• On triangulating planar graphs under the four-connectivity constraint
• On light graphs in the family of 4-connected planar graphs
• On vertex-degree restricted subgraphs in polyhedral graphs
• On vertex-degree restricted paths in polyhedral graphs
• The maximum number of paths of length four in a planar graph
• scientific article; zbMATH DE number 4145956 (Why is no real title available?)
• Light paths in 4-connected graphs in the plane and other surfaces
• Paths with restricted degrees of their vertices in planar graphs
• On the Number of 4-Edge Paths in Graphs With Given Edge Density
• Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
• Bounds on path connectivity

This page was built for publication:

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