Name
Abstract | ||
|---|---|---|
A graphG of ordern is said to be 3-placeable if there are three edge disjoint copies ofG inKn. In the paper we prove that every graph of ordern and size at mostn-2 is 3-placeable unless isomorphic either toK3 ? 2K1 or toK4 ? 4K1. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1007/BF01195330 | Graphs and Combinatorics |
Keywords | Field | DocType |
Edge Disjoint, Disjoint Copy | Graph,Topology,Discrete mathematics,Combinatorics,Monad (category theory),Disjoint sets,Isomorphism,Mathematics | Journal |
Volume | Issue | ISSN |
9 | 1 | 1435-5914 |
Citations | PageRank | References |
9 | 1.13 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mariusz Woźniak | 1 | 204 | 34.54 |
| A. Paweł Wojda | 2 | 25 | 9.04 |