nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A counterexample to the pseudo 2-factor isomorphic graph conjecture
|
Goedgebeur, Jan |
|
2015 |
193 |
C |
p. 57-60 4 p. |
artikel |
2 |
A linear-time kernelization for the Rooted k -Leaf Outbranching Problem
|
Kammer, Frank |
|
2015 |
193 |
C |
p. 126-138 13 p. |
artikel |
3 |
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
|
Komusiewicz, Christian |
|
2015 |
193 |
C |
p. 145-161 17 p. |
artikel |
4 |
Bijective counting of humps and peaks in ( k , a ) -paths
|
Yan, Sherry H.F. |
|
2015 |
193 |
C |
p. 208-212 5 p. |
artikel |
5 |
Chip-firing games on Eulerian digraphs and NP -hardness of computing the rank of a divisor on a graph
|
Kiss, Viktor |
|
2015 |
193 |
C |
p. 48-56 9 p. |
artikel |
6 |
Contents
|
|
|
2015 |
193 |
C |
p. v-vi nvt p. |
artikel |
7 |
Cycles in complementary prisms
|
Meierling, Dirk |
|
2015 |
193 |
C |
p. 180-186 7 p. |
artikel |
8 |
Extended graph rotation systems as a model for cyclic weaving on orientable surfaces
|
Akleman, Ergun |
|
2015 |
193 |
C |
p. 61-79 19 p. |
artikel |
9 |
Fragmented coloring of proper interval and split graphs
|
Diwan, Ajit |
|
2015 |
193 |
C |
p. 110-118 9 p. |
artikel |
10 |
Identifying codes and searching with balls in graphs
|
Kim, Younjin |
|
2015 |
193 |
C |
p. 39-47 9 p. |
artikel |
11 |
Neighbor sum distinguishing edge colorings of sparse graphs
|
Hu, Xiaolan |
|
2015 |
193 |
C |
p. 119-125 7 p. |
artikel |
12 |
On coupon colorings of graphs
|
Chen, Bob |
|
2015 |
193 |
C |
p. 94-101 8 p. |
artikel |
13 |
On the b -chromatic number of regular bounded graphs
|
Amine, El Sahili |
|
2015 |
193 |
C |
p. 174-179 6 p. |
artikel |
14 |
On the reformulated reciprocal sum-degree distance of graph transformations
|
Li, Shuchao |
|
2015 |
193 |
C |
p. 162-173 12 p. |
artikel |
15 |
Optimal open-locating-dominating sets in infinite triangular grids
|
Kincaid, Rex |
|
2015 |
193 |
C |
p. 139-144 6 p. |
artikel |
16 |
Privileged factors in the Thue–Morse word—A comparison of privileged words and palindromes
|
Peltomäki, Jarkko |
|
2015 |
193 |
C |
p. 187-199 13 p. |
artikel |
17 |
Restricted cycle factors and arc-decompositions of digraphs
|
Bang-Jensen, Jørgen |
|
2015 |
193 |
C |
p. 80-93 14 p. |
artikel |
18 |
Synthesizing cubes to satisfy a given intersection pattern
|
Qian, Weikang |
|
2015 |
193 |
C |
p. 11-38 28 p. |
artikel |
19 |
The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases
|
Punnen, Abraham P. |
|
2015 |
193 |
C |
p. 1-10 10 p. |
artikel |
20 |
The matching energy of random graphs
|
Chen, Xiaolin |
|
2015 |
193 |
C |
p. 102-109 8 p. |
artikel |
21 |
Three-arc graphs: Characterization and domination
|
Xu, Guangjun |
|
2015 |
193 |
C |
p. 200-207 8 p. |
artikel |