A toughness condition for a spanning tree with bounded total excesses (Q497366): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C05
@@ Property / Mathematics Subject Classification ID: 05C05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C38
@@ Property / Mathematics Subject Classification ID: 05C38 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6484836
@@ Property / zbMATH DE Number: 6484836 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+spanning \(k\)-trees
@@ Property / zbMATH Keywords: spanning \(k\)-trees / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+toughness
@@ Property / zbMATH Keywords: toughness / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+total excess
@@ Property / zbMATH Keywords: total excess / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00373-014-1487-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2000679221
@@ Property / OpenAlex ID: W2000679221 / 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 @@
+Planar graphs without adjacent cycles of length at most seven are 3-colorable
+Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Connected (g, f)-factors
@@ Property / cites work: Connected (g, f)-factors / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness, trees, and walks
@@ Property / cites work: Toughness, trees, and walks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4649987
@@ Property / cites work: Q4649987 / rank @@
+Normal rank
@@ Property / cites work @@
+On a connection between the existence of k-trees and the toughness of a graph
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:497366