On the size of graphs without repeated cycle lengths

DOI10.1016/j.dam.2017.07.021zbMath1372.05113arXiv1612.06021OpenAlexW2566149407MaRDI QIDQ2410242

Chunhui Lai

Publication date: 17 October 2017

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

Full work available at URL: https://arxiv.org/abs/1612.06021

zbMATH Keywords

cyclenumber of edges

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (3)

Spectral radius, edge-disjoint cycles and cycles of the same length ⋮ On the number of edges in some graphs ⋮ An old problem of Erdős: a graph without two cycles of the same length

Cites Work

• Some theorems of uniquely pancyclic graphs
• On maximum cycle-distributed graphs
• The number of edges in a maximum cycle-distributed graph
• On the size of graphs with all cycles having distinct length
• On simple MCD graphs containing a subgraph homeomorphic to \(K_ 4\)
• Covering non-uniform hypergraphs
• (2)-pancyclic graphs
• Pancyclic and Bipancyclic Graphs
• Some unsolved problems on cycles
• Note on graphs without repeated cycle lengths
• A lower bound for the number of edges in a graph containing no two cycles of the same length
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the size of graphs without repeated cycle lengths