Packing two copies of a sparse graph into a graph with restrained maximum degree (Q3652549): 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.1002/jgt.20384
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20384 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4250459767
@@ Property / OpenAlex ID: W4250459767 / rank @@
+Normal rank
@@ Property / cites work @@
+Packings of graphs and applications to computational complexity
+Normal rank
@@ Property / cites work @@
+Embedding (p,p - 1) graphs in their complements
@@ Property / cites work: Embedding (p,p - 1) graphs in their complements / rank @@
+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 @@
+Q4325294
@@ Property / cites work: Q4325294 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing of graphs - a survey
@@ Property / cites work: Packing of graphs - a survey / rank @@
+Normal rank