| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A forbidden subgraph characterization of line-polar bipartite graphs
|
Huang, Jing
|
|
2010
|
158 |
6 |
p. 666-680
15 p.
|
article
|
| 2 |
Approximation algorithms for art gallery problems in polygons
|
Ghosh, Subir Kumar
|
|
2010
|
158 |
6 |
p. 718-722
5 p.
|
article
|
| 3 |
A proof of unimodality on the numbers of connected spanning subgraphs in an n -vertex graph with at least ⌈ ( 3 − 2 2 ) n 2 + n − 7 − 2 2 2 2 ⌉ edges
|
Cheng, Peng
|
|
2010
|
158 |
6 |
p. 608-619
12 p.
|
article
|
| 4 |
Bounds for visual cryptography schemes
|
Hajiabolhassan, Hossein
|
|
2010
|
158 |
6 |
p. 659-665
7 p.
|
article
|
| 5 |
Contents
|
|
|
2010
|
158 |
6 |
p. vii-viii
nvt p.
|
article
|
| 6 |
Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
|
Wu, Yaokun
|
|
2010
|
158 |
6 |
p. 706-717
12 p.
|
article
|
| 7 |
Editorial Board
|
|
|
2010
|
158 |
6 |
p. v-vi
nvt p.
|
article
|
| 8 |
Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
|
Johnson, Charles R.
|
|
2010
|
158 |
6 |
p. 681-691
11 p.
|
article
|
| 9 |
Erratum to: The incidence game chromatic number [Discrete Appl. Math. 157 (9) (2009) 1980–1987]
|
Andres, Stephan Dominique
|
|
2010
|
158 |
6 |
p. 728-
1 p.
|
article
|
| 10 |
First-Fit coloring of { P 5 , K 4 − e } -free graphs
|
Choudum, S.A.
|
|
2010
|
158 |
6 |
p. 620-626
7 p.
|
article
|
| 11 |
Interlace polynomials: Enumeration, unimodality and connections to codes
|
Danielsen, Lars Eirik
|
|
2010
|
158 |
6 |
p. 636-648
13 p.
|
article
|
| 12 |
L ( j , k ) -labelling and maximum ordering-degrees for trees
|
Juan, Justie Su-Tzu
|
|
2010
|
158 |
6 |
p. 692-698
7 p.
|
article
|
| 13 |
Local edge-connectivity augmentation in hypergraphs is NP-complete
|
Király, Zoltán
|
|
2010
|
158 |
6 |
p. 723-727
5 p.
|
article
|
| 14 |
Modified algorithms for the minimum volume enclosing axis-aligned ellipsoid problem
|
Cong, Wei-jie
|
|
2010
|
158 |
6 |
p. 627-635
9 p.
|
article
|
| 15 |
On shortest crucial words avoiding abelian powers
|
Avgustinovich, Sergey
|
|
2010
|
158 |
6 |
p. 605-607
3 p.
|
article
|
| 16 |
On the k th smallest and k th greatest modified Wiener indices of trees
|
Liu, Muhuo
|
|
2010
|
158 |
6 |
p. 699-705
7 p.
|
article
|
| 17 |
Variance of the subgraph count for sparse Erdős–Rényi graphs
|
Ellis, Robert B.
|
|
2010
|
158 |
6 |
p. 649-658
10 p.
|
article
|
Journal description