Name
Abstract | ||
|---|---|---|
Let n ≥ 7. Then there exists a uniform covering of 2-paths with 6-paths in Kn if and only if n ≡ 0,1,2 (mod 5). |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-30540-8_3 | IJCCGGT |
Keywords | Field | DocType |
complete graph,uniform covering | Discrete mathematics,Complete graph,Combinatorics,Edge-transitive graph,Forbidden graph characterization,Turán graph,Regular graph,Factor-critical graph,Distance-regular graph,Windmill graph,Mathematics | Conference |
Volume | ISSN | ISBN |
3330 | 0302-9743 | 3-540-24401-8 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jin Akiyama | 1 | 0 | 0.34 |
| Midori Kobayashi | 2 | 36 | 14.30 |
| Gisaku Nakamura | 3 | 77 | 24.13 |