no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A complete characterization of paths that are m -step competition graphs
|
Belmont, Eva |
|
2011 |
159 |
14 |
p. 1381-1390 10 p. |
article |
2 |
A new Euler–Mahonian constructive bijection
|
Vajnovszki, Vincent |
|
2011 |
159 |
14 |
p. 1453-1459 7 p. |
article |
3 |
A note on total reinforcement in graphs
|
Henning, Michael A. |
|
2011 |
159 |
14 |
p. 1443-1446 4 p. |
article |
4 |
Contents
|
|
|
2011 |
159 |
14 |
p. v- 1 p. |
article |
5 |
Degree sequences and graphs with disjoint spanning trees
|
Lai, Hong-Jian |
|
2011 |
159 |
14 |
p. 1447-1452 6 p. |
article |
6 |
Hamiltonian cycles passing through linear forests in k -ary n -cubes
|
Wang, Shiying |
|
2011 |
159 |
14 |
p. 1425-1435 11 p. |
article |
7 |
Minimum cost open chain reconfiguration
|
Nourollah, Ali |
|
2011 |
159 |
14 |
p. 1418-1424 7 p. |
article |
8 |
Properly colored paths and cycles
|
Fujita, Shinya |
|
2011 |
159 |
14 |
p. 1391-1397 7 p. |
article |
9 |
Recursive merge sort with erroneous comparisons
|
Hadjicostas, Petros |
|
2011 |
159 |
14 |
p. 1398-1417 20 p. |
article |
10 |
Sweeping an oval to a vanishing point
|
Dumitrescu, Adrian |
|
2011 |
159 |
14 |
p. 1436-1442 7 p. |
article |