scientific article; zbMATH DE number 4120198

MaRDI QIDQ4733880zbMATH OpenFDO

Authors Hansjoachim Walther, Jochen Harant

Publication date 1989

zbMATH Keywords

bridgelongest cycleshortness exponent

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Long cycles in 3-connected graphs
• scientific article; zbMATH DE number 3929042
• Publication:5753980
• On longest cycles in essentially 4-connected planar graphs
• Bridges of longest cycles

Cited in

(12)

• Graham's problem on shortest networks for points on a circle
• Bridges of longest cycles
• Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters
• Computing and counting longest paths on circular-arc graphs in polynomial time
• An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’
• Canonical forms for cycles in bridge graphs
• Longest cycles in cyclically 4-edge-connected cubic planar graphs
• Regular graphs in which every pair of points is missed by some longest cycle
• Shortness parameters of polyhedral graphs with few distinct vertex degrees
• Longest-edge \(n\)-section algorithms: properties and open problems
• Chords of longest circuits in locally planar graphs
• A note on 3-connected cubic planar graphs

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