Research graph
References from Further results on the number of cliques in graphs covered by long cycles. Local targets link to admitted publications; unresolved targets remain external evidence.
Maximal cycles in graphs
10.1016/0012-365x(91)90407-s · 1991 · External reference
On maximal paths and circuits of graphs
10.1007/bf02024498 · 1959 · External reference
Long cycles and the codiameter of a graph, I
10.1016/0095-8956(90)90024-t · 1990 · External reference
Subgraph coverings and edge switchings
10.1006/jctb.2001.2063 · 2002 · External reference
Stability in the Erdős–Gallai theorems on cycles and paths
10.1016/j.jctb.2016.06.004 · 2016 · External reference
Graphs with almost all edges in long cycles
10.1007/s00373-018-1950-4 · 2018 · External reference
The number of cliques in graphs covered by long cycles
10.1137/22m1476046 · 2023 · External reference
On graphs with randomly deleted edges
10.1007/bf01904874 · 1981 · External reference
On maximal paths and cycles in a graph
1977 · External reference
The maximum number of cliques in graphs without long cycles
10.1016/j.jctb.2017.08.005 · 2018 · External reference
Unresolved reference
External reference
Extensions of the Erdős–Gallai theorem and Luo's theorem
10.1017/s0963548319000269 · 2020 · External reference
The codiameter of a 2-connected graph
10.1016/j.disc.2007.03.036 · 2008 · External reference
Maximal circuits of graphs, I
10.1007/bf01902497 · 1976 · External reference
Subgraph coverings and edge switchings
10.1006/jctb.2001.2063 · ExternalCitation · doi-reference
Maximal circuits of graphs, I
10.1007/bf01902497 · ExternalCitation · doi-reference
On graphs with randomly deleted edges
10.1007/bf01904874 · ExternalCitation · doi-reference
On maximal paths and circuits of graphs
10.1007/bf02024498 · ExternalCitation · doi-reference
Graphs with almost all edges in long cycles
10.1007/s00373-018-1950-4 · ExternalCitation · doi-reference
Maximal cycles in graphs
10.1016/0012-365x(91)90407-s · ExternalCitation · doi-reference
Long cycles and the codiameter of a graph, I
10.1016/0095-8956(90)90024-t · ExternalCitation · doi-reference
The codiameter of a 2-connected graph
10.1016/j.disc.2007.03.036 · ExternalCitation · doi-reference
Stability in the Erdős–Gallai theorems on cycles and paths
10.1016/j.jctb.2016.06.004 · ExternalCitation · doi-reference
The maximum number of cliques in graphs without long cycles
10.1016/j.jctb.2017.08.005 · ExternalCitation · doi-reference
Extensions of the Erdős–Gallai theorem and Luo's theorem
10.1017/s0963548319000269 · ExternalCitation · doi-reference
The number of cliques in graphs covered by long cycles
10.1137/22m1476046 · ExternalCitation · doi-reference
