| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A generalization of Opsut’s result on the competition numbers of line graphs
|
Kim, Suh-Ryung
|
|
2015
|
181 |
C |
p. 152-159
8 p.
|
article
|
| 2 |
Balanced partitions of 3-colored geometric sets in the plane
|
Bereg, Sergey
|
|
2015
|
181 |
C |
p. 21-32
12 p.
|
article
|
| 3 |
Characterizing and computing the structure of clique intersections in strongly chordal graphs
|
Nevries, Ragnar
|
|
2015
|
181 |
C |
p. 221-234
14 p.
|
article
|
| 4 |
Classification of digital n -manifolds
|
Evako, Alexander V.
|
|
2015
|
181 |
C |
p. 289-296
8 p.
|
article
|
| 5 |
Contents
|
|
|
2015
|
181 |
C |
p. v-vi
nvt p.
|
article
|
| 6 |
Counting independent sets in a tolerance graph
|
Lin, Min-Sheng
|
|
2015
|
181 |
C |
p. 174-184
11 p.
|
article
|
| 7 |
Cycle Kronecker products that are representable as optimal circulants
|
Jha, Pranava K.
|
|
2015
|
181 |
C |
p. 130-138
9 p.
|
article
|
| 8 |
Distance domination, guarding and covering of maximal outerplanar graphs
|
Canales, Santiago
|
|
2015
|
181 |
C |
p. 41-49
9 p.
|
article
|
| 9 |
ℓ -facial edge colorings of graphs
|
Lužar, Borut
|
|
2015
|
181 |
C |
p. 193-200
8 p.
|
article
|
| 10 |
Fault-tolerant maximal local-connectivity on Bubble-sort star graphs
|
Cai, Hongyan
|
|
2015
|
181 |
C |
p. 33-40
8 p.
|
article
|
| 11 |
From preemptive to non-preemptive speed-scaling scheduling
|
Bampis, Evripidis
|
|
2015
|
181 |
C |
p. 11-20
10 p.
|
article
|
| 12 |
Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles
|
Erveš, Rija
|
|
2015
|
181 |
C |
p. 90-97
8 p.
|
article
|
| 13 |
k -restricted edge connectivity in ( p + 1 ) -clique-free graphs
|
Wang, Shiying
|
|
2015
|
181 |
C |
p. 255-259
5 p.
|
article
|
| 14 |
Lot sizing with minimum order quantity
|
Park, Young Woong
|
|
2015
|
181 |
C |
p. 235-254
20 p.
|
article
|
| 15 |
Maintaining centdians in a fully dynamic forest with top trees
|
Wang, Hung-Lung
|
|
2015
|
181 |
C |
p. 310-315
6 p.
|
article
|
| 16 |
On realizations of a joint degree matrix
|
Czabarka, Éva
|
|
2015
|
181 |
C |
p. 283-288
6 p.
|
article
|
| 17 |
On the continuity of graph parameters
|
Hurshman, M.
|
|
2015
|
181 |
C |
p. 123-129
7 p.
|
article
|
| 18 |
On the general sum-connectivity index of connected unicyclic graphs with k pendant vertices
|
Tomescu, Ioan
|
|
2015
|
181 |
C |
p. 306-309
4 p.
|
article
|
| 19 |
On the geodeticity of the contour of a graph
|
Mezzini, Mauro
|
|
2015
|
181 |
C |
p. 209-220
12 p.
|
article
|
| 20 |
On the transportation problem with market choice
|
Damcı-Kurt, Pelin
|
|
2015
|
181 |
C |
p. 54-77
24 p.
|
article
|
| 21 |
On triangulating k -outerplanar graphs
|
Biedl, Therese
|
|
2015
|
181 |
C |
p. 275-279
5 p.
|
article
|
| 22 |
Path-driven orientation of mixed graphs
|
Fertin, Guillaume
|
|
2015
|
181 |
C |
p. 98-108
11 p.
|
article
|
| 23 |
Resistance distance-based graph invariants of subdivisions and triangulations of graphs
|
Yang, Yujun
|
|
2015
|
181 |
C |
p. 260-274
15 p.
|
article
|
| 24 |
Sandwiching the (generalized) Randić index
|
Knor, Martin
|
|
2015
|
181 |
C |
p. 160-166
7 p.
|
article
|
| 25 |
Sets of even type on H ( 5 , q 2 ) , q even
|
Cossidente, Antonio
|
|
2015
|
181 |
C |
p. 280-282
3 p.
|
article
|
| 26 |
Some results on the avoidance of vincular patterns by multisets
|
Mansour, Toufik
|
|
2015
|
181 |
C |
p. 201-208
8 p.
|
article
|
| 27 |
Some star-critical Ramsey numbers
|
Li, Zhen
|
|
2015
|
181 |
C |
p. 301-305
5 p.
|
article
|
| 28 |
Sorting by Prefix Reversals and Prefix Transpositions
|
Dias, Zanoni
|
|
2015
|
181 |
C |
p. 78-89
12 p.
|
article
|
| 29 |
The connectivity and the Harary index of a graph
|
Li, Xiao-Xin
|
|
2015
|
181 |
C |
p. 167-173
7 p.
|
article
|
| 30 |
The decycling number of generalized Petersen graphs
|
Gao, Liqing
|
|
2015
|
181 |
C |
p. 297-300
4 p.
|
article
|
| 31 |
The minimum span of L ( 2 , 1 ) -labelings of generalized flowers
|
Karst, Nathaniel
|
|
2015
|
181 |
C |
p. 139-151
13 p.
|
article
|
| 32 |
The number of steps and the final configuration of relaxation procedures on graphs
|
Chen, Sheng-Hua
|
|
2015
|
181 |
C |
p. 50-53
4 p.
|
article
|
| 33 |
The Pfaffian property of circulant graphs
|
Lu, Fuliang
|
|
2015
|
181 |
C |
p. 185-192
8 p.
|
article
|
| 34 |
The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
|
Hung, Ruo-Wei
|
|
2015
|
181 |
C |
p. 109-122
14 p.
|
article
|
| 35 |
Upper bounds on the k -forcing number of a graph
|
Amos, David
|
|
2015
|
181 |
C |
p. 1-10
10 p.
|
article
|
Journal description