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

DOI10.7151/DMGT.1601zbMATH Open1255.05107OpenAlexW1994338883MaRDI QIDQ4647868

Author name not available (Why is that?)

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

cyclesextremal graphsedge disjoint

Mathematics Subject Classification ID

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

Related Items (2)

Title not available (Why is that?) ⋮ Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree 👍 👎
• The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices 👍 👎
• Edge-disjoint maximal planar graphs 👍 👎
• Edge-maximal graphs without \(\theta_{2k+1}\)-graphs 👍 👎
• Edge-maximal \(C_{2k+1}\)-vertex disjoint free graphs 👍 👎
• Edge‐maximal (k, i)‐graphs 👍 👎
• Edge-Maximal 𝜃_k+1-Edge Disjoint Free Graphs 👍 👎
• Maximum Edge-Disjoint Paths in k-Sums of Graphs 👍 👎

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)