The extremal function for two disjoint cycles

DOI10.1007/S40840-014-0102-0MaRDI QIDQ745932zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 1533071 (Why is no real title available?)
• scientific article; zbMATH DE number 3215865 (Why is no real title available?)
• K₄⁻‐factor in a graph
• Bandwidth of theta graphs with short paths
• Disjoint chorded cycles in graphs
• Graph theory
• Independence number and disjoint theta graphs
• On a sharp degree sum condition for disjoint chorded cycles in graphs
• On arithmetic progressions of cycle lengths in graphs
• On the chromatic roots of generalized theta graphs
• Vertex-disjoint cycles of order eight with chords in a bipartite graph

Cited in

(4)

• Independence number and disjoint theta graphs
• Sharp minimum degree conditions for the existence of disjoint theta graphs
• The extremal function for three disjoint theta graphs.
• The edge condition for independent cycles with chords in bipartite 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)