Stability of Woodall's theorem and spectral conditions for large cycles
From MaRDI portal
Publication:2692178
DOI10.37236/11641OpenAlexW4323670404WikidataQ122585921 ScholiaQ122585921MaRDI QIDQ2692178
Publication date: 21 March 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/11641
closure operationHamiltonian graphcliqueWoodall's conjecture2-connected graphedge-switching techniquegraph circumference
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stability in the Erdős-Gallai theorems on cycles and paths
- Proof of a conjecture on the spectral radius of \(C_4\)-free graphs
- Spectra of graphs
- Arc coverings of graphs
- Stability results on the circumference of a graph
- Spectral extrema of graphs: forbidden hexagon
- The spectral radius of graphs without paths and cycles of specified length
- The maximum spectral radius of \(C_4\)-free graphs of given order and size
- On a conjecture of V. Nikiforov
- A method in graph theory
- Bounds of eigenvalues of graphs
- Stability in the Erdős-Gallai theorem on cycles and paths. II
- The spectral radius of graphs without long cycles
- The spectral radius of trees on \(k\) pendant vertices
- A sharp upper bound of the spectral radius of graphs
- A note on cycle lengths in graphs
- Signless Laplacian spectral radius of graphs without short cycles or long cycles
- A conjecture on the spectral radius of graphs
- The spectral radius of graphs with no odd wheels
- Spectral conditions for the existence of specified paths and cycles in graphs
- Sharp upper bounds of the spectral radius of a graph
- Spectral extrema for graphs: the Zarankiewicz problem
- A stability version for a theorem of Erdős on nonhamiltonian graphs
- Bounds on graph eigenvalues. II
- A spectral condition for odd cycles in graphs
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Pancyclic graphs. I
- Large cycles in graphs
- Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Maximal circuits of graphs. I
- Spectral radius and Hamiltonian properties of graphs, II
- Extensions of the Erdős–Gallai theorem and Luo’s theorem
- The History of Degenerate (Bipartite) Extremal Graph Problems
- Sufficient Conditions for Circuits in Graphs†
- Spectral radius and Hamiltonicity of graphs
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
- Eigenvalues and cycles of consecutive lengths
This page was built for publication: Stability of Woodall's theorem and spectral conditions for large cycles