The extremal function for two disjoint cycles

DOI10.1007/S40840-014-0102-0zbMATH Open1322.05075OpenAlexW2081687177MaRDI QIDQ745932FDOQ745932

Authors: Naidan Ji, Yunshu 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

Recommendations

• The extremal function for three disjoint theta graphs.
• SUFFICIENT CONDITION FOR THE EXISTENCE OF THREE DISJOINT THETA GRAPHS
• Independence number and disjoint theta graphs
• Sharp minimum degree conditions for the existence of disjoint theta graphs
• Disjoint even cycles packing

zbMATH Keywords

extremal functionminimum degreedisjoint theta graph

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Title not available (Why is that?)
• On arithmetic progressions of cycle lengths in graphs
• Bandwidth of theta graphs with short paths
• On a sharp degree sum condition for disjoint chorded cycles in graphs
• Disjoint chorded cycles in graphs
• On the chromatic roots of generalized theta graphs
• K₄⁻‐factor in a graph
• Independence number and disjoint theta graphs
• Vertex-disjoint cycles of order eight with chords in a bipartite graph
• Title not available (Why is that?)

Cited In (4)

• Sharp minimum degree conditions for the existence of disjoint theta graphs
• The edge condition for independent cycles with chords in bipartite graphs
• The extremal function for three disjoint theta graphs.
• Independence number and disjoint theta graphs

This page was built for publication: The extremal function for two disjoint cycles

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