Edge maximal C_{2k+1}-edge disjoint free graphs

DOI10.7151/DMGT.1601MaRDI QIDQ4647868zbMATH OpenOpenAlexFDO

Authors

Publication date 8 November 2012

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1601

zbMATH Keywords

cyclesedge disjointextremal graphs

Mathematics Subject Classification ID

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

Recommendations

• Edge-maximal \(C_{2k+1}\)-vertex disjoint free graphs
• Edge-maximal \(\theta_{2k+1}\)-edge disjoint free graphs
• scientific article; zbMATH DE number 5943492
• Edge‐maximal (k, i)‐graphs
• Edge-maximal graphs without \(\theta_{2k+1}\)-graphs
• Edge-disjoint maximal planar graphs
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• Maximum edge-disjoint paths in k-sums of graphs
• scientific article; zbMATH DE number 1071407
• The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices

Cited in

(6)

• Edge-maximal \(C_{2k+1}\)-vertex disjoint free graphs
• scientific article; zbMATH DE number 5943492 (Why is no real title available?)
• scientific article; zbMATH DE number 147631 (Why is no real title available?)
• scientific article; zbMATH DE number 1071407 (Why is no real title available?)
• Edge-maximal \(\theta_{2k+1}\)-edge disjoint free graphs
• Turán numbers for vertex-disjoint triangles and pentagons

This page was built for publication: Edge maximal C_{2k+1}-edge disjoint free graphs

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