|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
14 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A generic approach to proving NP-hardness of partition type problems |
Kovalyov, Mikhail Y. |
2010 |
158 | 17 |
p. 1908-1912 5 p. |
article |
|
| 2 | Approximating maximum edge 2-coloring in simple graphs |
Chen, Zhi-Zhong |
2010 |
158 | 17 |
p. 1894-1901 8 p. |
article |
|
| 3 | Contents |
2010 |
158 | 17 |
p. v- 1 p. |
article |
||
| 4 | Covering line graphs with equivalence relations |
Esperet, Louis |
2010 |
158 | 17 |
p. 1902-1907 6 p. |
article |
|
| 5 | Dynamic list coloring of bipartite graphs |
Esperet, Louis |
2010 |
158 | 17 |
p. 1963-1965 3 p. |
article |
|
| 6 | Exact values of e x ( ν ; { C 3 , C 4 , … , C n } ) |
Abajo, E. |
2010 |
158 | 17 |
p. 1869-1878 10 p. |
article |
|
| 7 | Generalized sequences and k -independent sets in graphs |
Włoch, Iwona |
2010 |
158 | 17 |
p. 1966-1970 5 p. |
article |
|
| 8 | Hamiltonicity of 6-connected line graphs |
Zhan, Mingquan |
2010 |
158 | 17 |
p. 1971-1975 5 p. |
article |
|
| 9 | Lit-only σ -game on pseudo-trees |
Wang, Xinmao |
2010 |
158 | 17 |
p. 1945-1952 8 p. |
article |
|
| 10 | On mean distance and girth |
Bekkai, Siham |
2010 |
158 | 17 |
p. 1888-1893 6 p. |
article |
|
| 11 | Reoptimizing the 0–1 knapsack problem |
Archetti, Claudia |
2010 |
158 | 17 |
p. 1879-1887 9 p. |
article |
|
| 12 | Sharp bounds for the Zagreb indices of bicyclic graphs with k -pendant vertices |
Zhao, Qin |
2010 |
158 | 17 |
p. 1953-1962 10 p. |
article |
|
| 13 | Tree 3-spanners in 2-sep chordal graphs: Characterization and algorithms |
Panda, B.S. |
2010 |
158 | 17 |
p. 1913-1935 23 p. |
article |
|
| 14 | Use of the Szeged index and the revised Szeged index for measuring network bipartivity |
Pisanski, Tomaž |
2010 |
158 | 17 |
p. 1936-1944 9 p. |
article |
14 results found