Abstract | ||
---|---|---|
Two graphs G 1 and G 2 , each on n vertices, pack if there exists a bijection f from V ( G 1 ) onto V ( G 2 ) such that u v ź E ( G 1 ) only if f ( u ) f ( v ) ź E ( G 2 ) . In 2014, Alon and Yuster proved that, for sufficiently large n , if | E ( G 1 ) | |
Year | DOI | Venue |
---|---|---|
2016 | 10.1016/j.disc.2016.05.023 | Discrete Mathematics |
Keywords | Field | DocType |
Graph packing,Maximum degree,Edge sum | Discrete mathematics,Graph,Combinatorics,Bijection,Vertex (geometry),Packing problems,Graph packing,Degree (graph theory),Mathematics | Journal |
Volume | Issue | ISSN |
339 | 11 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Alexandr V. Kostochka | 1 | 682 | 89.87 |
Andrew McConvey | 2 | 3 | 1.76 |
Derrek Yager | 3 | 1 | 1.11 |