Maximizing the size of planar graphs under girth constraints

MaRDI QIDQ2875897zbMATH OpenFDO

Authors Costas S. Iliopoulos, Mirka Miller, Michalis Christou

Publication date 12 August 2014

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

maximal number of edgesextremal \(C_t\)-free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• On extremal graphs with bounded girth
• New results on EX graphs
• scientific article; zbMATH DE number 5989950
• Size of Graphs with High Girth
• scientific article; zbMATH DE number 951844

Cited in

(2)

• Computing the Girth of a Planar Graph in O(n logn) Time
• Extremal problems on planar graphs without k edge-disjoint cycles

This page was built for publication: Maximizing the size of planar graphs under girth constraints

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