Long cycles and the codiameter of a graph. I

DOI10.1016/0095-8956(90)90024-TMaRDI QIDQ749555zbMATH OpenFDO

Authors Genghua Fan

Publication date 1990

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(90)90024-T

zbMATH Keywords

codiameterlongest cycles

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• Publication:3204491
• The codiameter of a 2-connected graph
• scientific article; zbMATH DE number 1159837
• The longest cycles in a graph G with minimum degree at least \(| G| /k\)
• scientific article; zbMATH DE number 2075816

Cites work

• scientific article; zbMATH DE number 3353327 (Why is no real title available?)
• Large cycles in graphs
• On maximal paths and circuits of graphs
• Some Theorems on Abstract Graphs

Cited in

(16)

• The codiameter of a 2-connected graph
• scientific article; zbMATH DE number 4181375 (Why is no real title available?)
• The Erdős-Sós conjecture for spiders of large size
• scientific article; zbMATH DE number 2075816 (Why is no real title available?)
• Extensions of the Erdős-Gallai theorem and Luo's theorem
• Circumdetic graphs
• Long paths and cycles passing through specified vertices under the average degree condition
• The Number of Cliques in Graphs Covered by Long Cycles
• A stability result of the Pósa lemma
• Longest cycle above Erdős-Gallai bound
• A localized approach for Turán number of long cycles
• Longest cycle above Erdős-Gallai bound
• A hypergraph analog of Dirac's theorem for long cycles in 2-connected graphs. II: Large uniformities
• An inductive proof of Dirac's theorem on Hamilton cycles
• Stability results on the circumference of a graph
• On the length of longest chordless cycles

This page was built for publication: Long cycles and the codiameter of a graph. I

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