Edge-disjoint spanning trees and eigenvalues of regular graphs (Q426054): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C05
@@ Property / Mathematics Subject Classification ID: 05C05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C50
@@ Property / Mathematics Subject Classification ID: 05C50 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C40
@@ Property / Mathematics Subject Classification ID: 05C40 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6044812
@@ Property / zbMATH DE Number: 6044812 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+edge-disjoint spanning trees
@@ Property / zbMATH Keywords: edge-disjoint spanning trees / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+eigenvalue
@@ Property / zbMATH Keywords: eigenvalue / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+connectivity
@@ Property / zbMATH Keywords: connectivity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+toughness
@@ Property / zbMATH Keywords: toughness / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+edge-toughness
@@ Property / zbMATH Keywords: edge-toughness / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2962940504
@@ Property / OpenAlex ID: W2962940504 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2245
@@ Property / arXiv ID: 1312.2245 / 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 and spectrum of a graph
@@ Property / cites work: Toughness and spectrum of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Spectra of graphs
@@ Property / cites work: Spectra of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-connectivity and edge-disjoint spanning trees
+Normal rank
@@ Property / cites work @@
+On the higher-order edge toughness of a graph
@@ Property / cites work: On the higher-order edge toughness of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Eigenvalues and edge-connectivity of regular graphs
+Normal rank
@@ Property / cites work @@
+Optimal attack and reinforcement of a network
@@ Property / cites work: Optimal attack and reinforcement of a network / rank @@
+Normal rank
@@ Property / cites work @@
+Q2716030
@@ Property / cites work: Q2716030 / rank @@
+Normal rank
@@ Property / cites work @@
+Interlacing eigenvalues and graphs
@@ Property / cites work: Interlacing eigenvalues and graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix Analysis
@@ Property / cites work: Matrix Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+A short proof of the tree-packing theorem
@@ Property / cites work: A short proof of the tree-packing theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding Spanning Trees in Random Graphs
@@ Property / cites work: Embedding Spanning Trees in Random Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds of the number of disjoint spanning trees
@@ Property / cites work: Bounds of the number of disjoint spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning trees: A survey
@@ Property / cites work: Spanning trees: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+On the spanning tree packing number of a graph: A survey
+Normal rank
@@ Property / cites work @@
+On the Problem of Decomposing a Graph into <i>n</i>  Connected Factors
+Normal rank
@@ Property / cites work @@
+Q4869540
@@ Property / cites work: Q4869540 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:426054