Using edge cuts to find Euler tours and Euler families in hypergraphs (Q6172287): Difference between revisions

@@ Property / cites work @@
+Connection and separation in hypergraphs
@@ Property / cites work: Connection and separation in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi-Eulerian hypergraphs
@@ Property / cites work: Quasi-Eulerian hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing minimum cuts in hypergraphs
@@ Property / cites work: Computing minimum cuts in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On tours that contain all edges of a hypergraph
@@ Property / cites work: On tours that contain all edges of a hypergraph / rank @@
+Normal rank
@@ Property / cites work @@
+Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts
+Normal rank