On maximum cycle-distributed graphs

DOI10.1016/0012-365X(88)90030-1MaRDI QIDQ1108290zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1151856
• An old problem of Erdős: a graph without two cycles of the same length
• On the size of graphs with all cycles having distinct length
• On the number of edges in some graphs
• A lower bound for the number of edges in a graph containing no two cycles of the same length

Cites work

• scientific article; zbMATH DE number 568835 (Why is no real title available?)
• Graph theory

Cited in

(17)

• scientific article; zbMATH DE number 1933072 (Why is no real title available?)
• On absorbing cycles in min-max digraphs
• Nested cycles with no geometric crossings
• 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
• Non-repeated cycle lengths and Sidon sequences
• On the size of graphs with all cycles having distinct length
• On simple MCD graphs containing a subgraph homeomorphic to \(K_ 4\)
• The maximum number of cycles in the complement of a tree
• The edge numbers of a class of graphs
• Some open problems on cycles
• The number of edges in a maximum cycle-distributed graph
• On the size of graphs without repeated cycle lengths
• Spectral radius, edge-disjoint cycles and cycles of the same length
• On the number of sets of cycle lengths

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

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