scientific article; zbMATH DE number 1496607

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200007)34:3<221::AID-JGT3>3.0.CO;2-T" /><221::AID-JGT3>3.0.CO;2-T 10.1002/1097-0118(200007)34:3<221::AID-JGT3>3.0.CO;2-TzbMath0973.05047MaRDI QIDQ4500709

D. K. Menser, Mark N. Ellingham

Publication date: 28 November 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

girthcircumferenceminimum degreelongest circuit

Mathematics Subject Classification ID

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

Related Items (4)

Length of longest cycles in a graph whose relative length is at least two ⋮ Long paths and cycles in random subgraphs of \(\mathcal{H}\)-free graphs ⋮ Spanning paths in graphs ⋮ Cycle lengths in sparse graphs

Cites Work

• Unnamed Item
• On the edge-chromatic number of a graph
• Circumference and girth
• A new series of dense graphs of high girth
• On a graph theorem by dirac

This page was built for publication: