Structuring the elementary components of graphs having a perfect internal matching. (Q1874391): Difference between revisions

@@ Property / cites work @@
+A structure theorem for maximum internal matchings in graphs
+Normal rank
@@ Property / cites work @@
+Q4864783
@@ Property / cites work: Q4864783 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2714409
@@ Property / cites work: Q2714409 / rank @@
+Normal rank
@@ Property / cites work @@
+Soliton automata
@@ Property / cites work: Soliton automata / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic soliton automata with a single exterior node
+Normal rank
@@ Property / cites work @@
+Deterministic soliton automata with at most one cycle
+Normal rank
@@ Property / cites work @@
+Automata represented by products of soliton automata
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank