no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A family of mixed graphs with large order and diameter 2
|
Araujo-Pardo, G. |
|
2017 |
218 |
C |
p. 57-63 7 p. |
article |
2 |
A linear-time algorithm for finding a paired 2-disjoint path cover in the cube of a connected graph
|
Ihm, Insung |
|
2017 |
218 |
C |
p. 98-112 15 p. |
article |
3 |
An infinite family of 2-connected graphs that have reliability factorisations
|
Morgan, Kerri |
|
2017 |
218 |
C |
p. 123-127 5 p. |
article |
4 |
Contents
|
|
|
2017 |
218 |
C |
p. v- 1 p. |
article |
5 |
Cooperative games with restricted formation of coalitions
|
Koshevoy, Gleb |
|
2017 |
218 |
C |
p. 1-13 13 p. |
article |
6 |
Counting independent sets in tree convex bipartite graphs
|
Lin, Min-Sheng |
|
2017 |
218 |
C |
p. 113-122 10 p. |
article |
7 |
Maximum Laplacian energy of unicyclic graphs
|
Das, Kinkar Ch. |
|
2017 |
218 |
C |
p. 71-81 11 p. |
article |
8 |
0-1 multilinear programming as a unifying theory for LAD pattern generation
|
Yan, Kedong |
|
2017 |
218 |
C |
p. 21-39 19 p. |
article |
9 |
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
|
Dehghan, Ali |
|
2017 |
218 |
C |
p. 82-97 16 p. |
article |
10 |
Paired many-to-many disjoint path covers of hypertori
|
Kronenthal, Brian G. |
|
2017 |
218 |
C |
p. 14-20 7 p. |
article |
11 |
Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs
|
Chen, Zhibing |
|
2017 |
218 |
C |
p. 64-70 7 p. |
article |
12 |
Vertex adjacencies in the set covering polyhedron
|
Aguilera, Néstor E. |
|
2017 |
218 |
C |
p. 40-56 17 p. |
article |