Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs (Q2828824): Difference between revisions

@@ Property / OpenAlex ID @@
+W2963305315
@@ Property / OpenAlex ID: W2963305315 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05922
@@ Property / arXiv ID: 1602.05922 / rank @@
+Normal rank
@@ Property / cites work @@
+Tough Ramsey graphs without short cycles
@@ Property / cites work: Tough Ramsey graphs without short cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness in graphs -- a survey
@@ Property / cites work: Toughness in graphs -- a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q3127430
@@ Property / cites work: Q3127430 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and spectrum of a graph
@@ Property / cites work: Toughness and spectrum of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Small spectral gap in the combinatorial Laplacian implies Hamiltonian
+Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Eigenvalues and edge-connectivity of regular graphs
+Normal rank
@@ Property / cites work @@
+Matchings in regular graphs from eigenvalues
@@ Property / cites work: Matchings in regular graphs from eigenvalues / rank @@
+Normal rank
@@ Property / cites work @@
+The spectrum and toughness of regular graphs
@@ Property / cites work: The spectrum and toughness of regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint spanning trees and eigenvalues of regular graphs
+Normal rank
@@ Property / cites work @@
+Bounds on the size of graphs of given order and \(l\)-connectivity
+Normal rank
@@ Property / cites work @@
+Toughness, trees, and walks
@@ Property / cites work: Toughness, trees, and walks / rank @@
+Normal rank
@@ Property / cites work @@
+Q3877805
@@ Property / cites work: Q3877805 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5682350
@@ Property / cites work: Q5682350 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2716030
@@ Property / cites work: Q2716030 / rank @@
+Normal rank
@@ Property / cites work @@
+Spectral conditions for edge connectivity and packing spanning trees in multigraphs
+Normal rank
@@ Property / cites work @@
+Regular factors and eigenvalues of regular graphs
@@ Property / cites work: Regular factors and eigenvalues of regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs
+Normal rank
@@ Property / cites work @@
+Characterization of minimally \((2,l)\)-connected graphs
+Normal rank
@@ Property / cites work @@
+Q5477817
@@ Property / cites work: Q5477817 / rank @@
+Normal rank
@@ Property / cites work @@
+Sparse pseudo‐random graphs are Hamiltonian
@@ Property / cites work: Sparse pseudo‐random graphs are Hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-disjoint spanning trees and eigenvalues of graphs
+Normal rank
@@ Property / cites work @@
+Algebraic conditions for t-tough graphs
@@ Property / cites work: Algebraic conditions for t-tough graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Note on edge-disjoint spanning trees and eigenvalues
+Normal rank
@@ Property / cites work @@
+Edge-disjoint spanning trees and eigenvalues
@@ Property / cites work: Edge-disjoint spanning trees and eigenvalues / rank @@
+Normal rank
@@ Property / cites work @@
+Regular Graphs, Eigenvalues and Regular Factors
@@ Property / cites work: Regular Graphs, Eigenvalues and Regular Factors / rank @@
+Normal rank
@@ Property / cites work @@
+Regular factors of regular graphs from eigenvalues
+Normal rank
@@ Property / cites work @@
+On the \(\ell\)-connectivity of a graph
@@ Property / cites work: On the \(\ell\)-connectivity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees: A survey
@@ Property / cites work: Spanning trees: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+On a connection between the existence of k-trees and the toughness of a graph
+Normal rank