A near packing of two graphs (Q1850487): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1006/jctb.2000.1971
+Normal rank
@@ Property / OpenAlex ID @@
+W2054349075
@@ Property / OpenAlex ID: W2054349075 / rank @@
+Normal rank
@@ Property / cites work @@
+-factors in dense graphs
@@ Property / cites work: 2-factors in dense graphs / 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 @@
+Edge disjoint placement of graphs
@@ Property / cites work: Edge disjoint placement of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Packing of graphs - a survey
@@ Property / cites work: Packing of graphs - a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Packing of three copies of a graph
@@ Property / cites work: Packing of three copies of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Packing two forests into a bipartite graph
@@ Property / cites work: Packing two forests into a bipartite graph / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1850487