A local independence number condition for \(n\)-extendable graphs (Q1296992): Difference between revisions

@@ Property / cites work @@
+N‐extendability of symmetric graphs
@@ Property / cites work: N‐extendability of symmetric graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and triangle-free graphs
@@ Property / cites work: Toughness and triangle-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4304323
@@ Property / cites work: Q4304323 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5284658
@@ Property / cites work: Q5284658 / rank @@
+Normal rank
@@ Property / cites work @@
+On n-extendable graphs
@@ Property / cites work: On n-extendable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3972523
@@ Property / cites work: Q3972523 / rank @@
+Normal rank
@@ Property / cites work @@
+Extending matchings in graphs: A survey
@@ Property / cites work: Extending matchings in graphs: A survey / rank @@
+Normal rank