On maximum cycle-distributed graphs

DOI10.1016/0012-365X(88)90030-1zbMath0654.05048OpenAlexW1981416130MaRDI QIDQ1108290

Yongbing Shi

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90030-1

zbMATH Keywords

maximum number of edgesno two cycles of the same length

Mathematics Subject Classification ID

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

Related Items (10)

Non-repeated cycle lengths and Sidon sequences ⋮ Spectral radius, edge-disjoint cycles and cycles of the same length ⋮ On the size of graphs without repeated cycle lengths ⋮ On the number of edges in some graphs ⋮ An old problem of Erdős: a graph without two cycles of the same length ⋮ (2)-pancyclic graphs ⋮ The number of edges in a maximum cycle-distributed graph ⋮ Covering non-uniform hypergraphs ⋮ On the size of graphs with all cycles having distinct length ⋮ On simple MCD graphs containing a subgraph homeomorphic to \(K_ 4\)

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: On maximum cycle-distributed graphs