Long cycles and the codiameter of a graph. I
From MaRDI portal
Publication:749555
DOI10.1016/0095-8956(90)90024-TzbMath0713.05043MaRDI QIDQ749555
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items (6)
The Erdős-Sós conjecture for spiders of large size ⋮ The Number of Cliques in Graphs Covered by Long Cycles ⋮ The codiameter of a 2-connected graph ⋮ Long paths and cycles passing through specified vertices under the average degree condition ⋮ Extensions of the Erdős–Gallai theorem and Luo’s theorem ⋮ Stability results on the circumference of a graph
Cites Work
This page was built for publication: Long cycles and the codiameter of a graph. I
