The extremal function for two disjoint cycles

DOI10.1007/s40840-014-0102-0zbMath1322.05075OpenAlexW2081687177MaRDI QIDQ745932

Naidan Ji, Yun Shu Gao

Publication date: 15 October 2015

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-014-0102-0

zbMATH Keywords

minimum degreeextremal functiondisjoint theta graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Related Items

The edge condition for independent cycles with chords in bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independence number and disjoint theta graphs
• On a sharp degree sum condition for disjoint chorded cycles in graphs
• Disjoint chorded cycles in graphs
• Bandwidth of theta graphs with short paths
• On the chromatic roots of generalized theta graphs
• Vertex-disjoint cycles of order eight with chords in a bipartite graph
• On Arithmetic Progressions of Cycle Lengths in Graphs
• K₄⁻‐factor in a graph