Wang, Hong(1-ID): Packing two copies of a sparse graph into a graph with restrained maximum degree. (English summary). - J. Graph Theory 62 (2009), no. 2, 178-187
Abstract
Wang, Hong(1-ID): Packing two copies of a sparse graph into a graph with restrained maximum degree. (English summary). - J. Graph Theory 62 (2009), no. 2, 178-187
Keywords
No keyword data available
Data
| Language: | English |
|---|---|
| Year of publishing: | 2010 |
| Typology: | 1.19 - Review, Book Review, Critique |
| Organization: | UM FNM - Faculty of Natural Sciences and Mathematics |
| UDC: | 519.17(049.3) |
| COBISS: |
15978329
|
| ISSN: | Y505-9674 |
| Views: | 134 |
| Downloads: | 14 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | Unknown |
|---|---|
| URN: | URN:SI:UM: |
| Type (COBISS): | Not categorized |
| Pages: | MR2555096 |
| Chronology: | 2010 |
| ID: | 1475613 |
Recommended works:
Wang, Hong(1-ID): Packing two copies of a sparse graph into a graph with restrained maximum degree. (English summary). - J. Graph Theory 62 (2009), no. 2, 178-187
2010,
no subtitle data available
Nešetřil, Jaroslav (CZ-KARLMP-CS); Valla, Tomáš (CZ-KARLMP-CS): On Ramsey-type positional games. (English summary). - J. Graph Theory 64 (2010), no. 4, 343-354
2011,
no subtitle data available
Scheide, Diego(D-ILTU-IM); Stiebitz, Michael(D-ILTU-IM): Vizing's coloring algorithm and the fan number. (English summary). - J. Graph Theory 65 (2010), no. 2, 115-138
2011,
no subtitle data available