|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
11 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | An efficient algorithm for computing the distance between close partitions |
Porumbel, Daniel Cosmin |
2011 |
159 | 1 |
p. 53-59 7 p. |
article |
|
| 2 | Contents |
2011 |
159 | 1 |
p. v- 1 p. |
article |
||
| 3 | Independence in connected graphs |
Harant, Jochen |
2011 |
159 | 1 |
p. 79-86 8 p. |
article |
|
| 4 | Matchability and k -maximal matchings |
Dean, Brian C. |
2011 |
159 | 1 |
p. 15-22 8 p. |
article |
|
| 5 | On the b -coloring of P 4 -tidy graphs |
Velasquez, Clara Inés Betancur |
2011 |
159 | 1 |
p. 60-68 9 p. |
article |
|
| 6 | On the existence problem of the total domination vertex critical graphs |
Sohn, Moo Young |
2011 |
159 | 1 |
p. 46-52 7 p. |
article |
|
| 7 | On the expressive power of CNF formulas of bounded tree- and clique-width |
Briquel, Irenée |
2011 |
159 | 1 |
p. 1-14 14 p. |
article |
|
| 8 | On the revised Szeged index |
Xing, Rundan |
2011 |
159 | 1 |
p. 69-78 10 p. |
article |
|
| 9 | Oriented matroid systems |
Huseby, Arne Bang |
2011 |
159 | 1 |
p. 31-45 15 p. |
article |
|
| 10 | Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem |
Guíñez, F. |
2011 |
159 | 1 |
p. 23-30 8 p. |
article |
|
| 11 | Total choosability of planar graphs with maximum degree 4 |
Roussel, Nicolas |
2011 |
159 | 1 |
p. 87-89 3 p. |
article |
11 results found