An Ore-type analogue of the Sauer-Spencer theorem (Q2385133): Difference between revisions

@@ Property / cites work @@
+Q4830805
@@ Property / cites work: Q4830805 / rank @@
+Normal rank
@@ Property / cites work @@
+Packings of graphs and applications to computational complexity
+Normal rank
@@ Property / cites work @@
+Subgraphs of graphs. I
@@ Property / cites work: Subgraphs of graphs. I / rank @@
+Normal rank
@@ Property / cites work @@
+Some Theorems on Abstract Graphs
@@ Property / cites work: Some Theorems on Abstract Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the existence of disjoint cycles in a graph
@@ Property / cites work: On the existence of disjoint cycles in a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer
+Normal rank
@@ Property / cites work @@
+On a graph packing conjecture by Bollobás, Eldridge and Catlin
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Edge disjoint placement of graphs
@@ Property / cites work: Edge disjoint placement of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximum number of independent cycles in a graph
+Normal rank