A characterization of nonfeasible sets in matching covered graphs (Q6134642): Difference between revisions

@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal ear decompositions of matching covered graphs and bases for the matching lattice
+Normal rank
@@ Property / cites work @@
+Graphs with independent perfect matchings
@@ Property / cites work: Graphs with independent perfect matchings / rank @@
+Normal rank
@@ Property / cites work @@
+How to build a brick
@@ Property / cites work: How to build a brick / rank @@
+Normal rank
@@ Property / cites work @@
+On perfect matchings in matching covered graphs
@@ Property / cites work: On perfect matchings in matching covered graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On essentially 4-edge-connected cubic bricks
@@ Property / cites work: On essentially 4-edge-connected cubic bricks / rank @@
+Normal rank
@@ Property / cites work @@
+Matching structure and the matching lattice
@@ Property / cites work: Matching structure and the matching lattice / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect Matchings of Regular Bipartite Graphs
@@ Property / cites work: Perfect Matchings of Regular Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning bipartite quadrangulations of even triangulations
+Normal rank
@@ Property / cites work @@
+On nonfeasible edge sets in matching‐covered graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6134642