Graphs with almost all edges in long cycles

DOI10.1007/s00373-018-1950-4zbMath1402.05054OpenAlexW2894418692WikidataQ129192523 ScholiaQ129192523MaRDI QIDQ1756098

Naidan Ji, Meirun Chen

Publication date: 11 January 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1950-4

zbMATH Keywords

cyclesextremal graphs2-connected graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Related Items (1)

The Number of Cliques in Graphs Covered by Long Cycles

Cites Work

• Cycles in 2-connected graphs
• Maximal cycles in graphs
• Subgraph coverings and edge switchings
• The codiameter of a 2-connected graph
• On maximal paths and circuits of graphs
• Maximal circuits of graphs. I

This page was built for publication: Graphs with almost all edges in long cycles