Eigenvalues and toughness of regular graphs
From MaRDI portal
Cites work
- A proof of Brouwer's toughness conjecture
- Algebraic conditions for t-tough graphs
- Bipartite toughness and \(k\)-factors in bipartite graphs
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Graph toughness from Laplacian eigenvalues
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 997668 (Why is no real title available?)
- scientific article; zbMATH DE number 109208 (Why is no real title available?)
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- Long cycles in graphs with prescribed toughness and minimum degree
- On toughness and \((g,f)\)-factors in bipartite graphs
- Spectral radius and Hamiltonicity of graphs
- The spectrum and toughness of regular graphs
- Tough graphs and Hamiltonian circuits.
- Tough Ramsey graphs without short cycles
- Toughness and spectrum of a graph
- Toughness and the existence of \(k\)-factors. III
- Toughness and the existence of k-factors. II
- Toughness and the existence ofk-factors
- Toughness in graphs -- a survey
- Toughness in pseudo-random graphs
- Toughness, Hamiltonicity and spectral radius in graphs
Cited in
(4)
This page was built for publication: Eigenvalues and toughness of regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7016879)