On the size of graphs with all cycles having distinct length

DOI10.1016/0012-365X(93)90311-GzbMath0790.05046MaRDI QIDQ1313878

Chunhui Lai

Publication date: 22 June 1994

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

zbMATH Keywords

cyclessize of graphs

Mathematics Subject Classification ID

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

Related Items

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 ⋮ Covering non-uniform hypergraphs

Cites Work

• Unnamed Item
• On maximum cycle-distributed graphs