Loading...
Please wait, while we are loading the content...
Similar Documents
Embedding Arbitrary Graphs of Maximum Degree Two
| Content Provider | Semantic Scholar |
|---|---|
| Author | Aigner, Martin Brandt, Stephan A. |
| Copyright Year | 1993 |
| Abstract | Let S(H) be the minimum degree of the graph H. We prove that a graph H of order n with S(H) ^ (2n —1)/3 contains any graph G of order at most n and maximum degree A(G) < 2 as a subgraph, and this bound is best possible. Furthermore, this result settles the case A(G) = 2 of the well-known conjecture of Bollobas, Catlin and Eldridge on packing two graphs with given maximum degree. |
| Starting Page | 39 |
| Ending Page | 51 |
| Page Count | 13 |
| File Format | PDF HTM / HTML |
| DOI | 10.1112/jlms/s2-48.1.39 |
| Volume Number | 48 |
| Alternate Webpage(s) | http://jlms.oxfordjournals.org/cgi/reprint/s2-48/1/39.pdf |
| Alternate Webpage(s) | https://doi.org/10.1112/jlms%2Fs2-48.1.39 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
