Name
Abstract | ||
|---|---|---|
We prove that three graphs of order n and size less than or equal to n −3 can be packed (edge-disjointly) into the complete graph K n . |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S0012-365X(00)00443-X | Discrete Mathematics |
Keywords | Field | DocType |
complete graph | Discrete mathematics,Combinatorics,Indifference graph,Partial k-tree,Chordal graph,Cograph,Pathwidth,1-planar graph,Pancyclic graph,Mathematics,Split graph | Journal |
Volume | Issue | ISSN |
236 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
5 | 0.72 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hamamache Kheddouci | 1 | 339 | 53.61 |
| Susan Marshall | 2 | 9 | 3.04 |
| Jean-François Saclé | 3 | 43 | 7.05 |
| Mariusz Woźniak | 4 | 204 | 34.54 |