Note on graphs without repeated cycle lengths

DOI10.1002/(SICI)1097-0118(199809)29:1%3C11::AID-JGT2%3E3.0.CO;2-HMaRDI QIDQ4242924zbMATH OpenOpenAlexFDO

Authors Guantao Chen, Jeno Lehel, Michael Jacobson, W. E. Shreve

Publication date 23 August 1999

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199809)29:1%3C11::aid-jgt2%3E3.0.co;2-h

zbMATH Keywords

cycle lengthsextremal graphSidon sequence

Mathematics Subject Classification ID

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

Recommendations

• A note on cycle lengths in graphs
• scientific article; zbMATH DE number 1933072
• On the size of graphs without repeated cycle lengths
• A note on graphs without short even cycles
• NOTE ON THE LENGTH OF ELEMENTARY CYCLES OF A GRAPH
• Some notes on cycle graphs
• Graphs without cycles of even length
• A note on embedding graphs without short cycles
• Unavoidable cycle lengths in graphs
• scientific article; zbMATH DE number 568792

Cited in

(10)

• A note on graphs without short even cycles
• Covering non-uniform hypergraphs
• A note on cycle lengths in graphs
• (2)-pancyclic graphs
• Non-repeated cycle lengths and Sidon sequences
• Spectral radius, edge-disjoint cycles and cycles of the same length
• On the number of edges in some graphs
• On the size of graphs without repeated cycle lengths
• A note on the number of edges in a Hamiltonian graph with no repeated cycle length
• An old problem of Erdős: a graph without two cycles of the same length

This page was built for publication: Note on graphs without repeated cycle lengths

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