A note on \(k\)-placeable graphs (Q409394): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2011.08.002
@@ Property / DOI: 10.1016/j.disc.2011.08.002 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C70
@@ Property / Mathematics Subject Classification ID: 05C70 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6023618
@@ Property / zbMATH DE Number: 6023618 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+packing graph
@@ Property / zbMATH Keywords: packing graph / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+\(k\)-placement
@@ Property / zbMATH Keywords: \(k\)-placement / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+edge disjoint
@@ Property / zbMATH Keywords: edge disjoint / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disc.2011.08.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2139230717
@@ Property / OpenAlex ID: W2139230717 / rank @@
+Normal rank
@@ Property / cites work @@
+Packings of graphs and applications to computational complexity
+Normal rank
@@ Property / cites work @@
+Every (p,p-2) graph is contained in its complement
+Normal rank
@@ Property / cites work @@
+On the packing of three graphs
@@ Property / cites work: On the packing of three graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Edge disjoint placement of graphs
@@ Property / cites work: Edge disjoint placement of graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2011.08.002
@@ Property / DOI: 10.1016/J.DISC.2011.08.002 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:409394