no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A column generation based algorithm for the robust graph coloring problem
|
Yüceoğlu, Birol |
|
2017 |
217 |
P2 |
p. 340-352 13 p. |
article |
2 |
Approximately counting paths and cycles in a graph
|
Yamamoto, Masaki |
|
2017 |
217 |
P2 |
p. 381-387 7 p. |
article |
3 |
Bounds on the independence number of a graph in terms of order, size and maximum degree
|
Rad, Nader Jafari |
|
2017 |
217 |
P2 |
p. 210-219 10 p. |
article |
4 |
Characterization of the allowed patterns of signed shifts
|
Archer, Kassie |
|
2017 |
217 |
P2 |
p. 97-109 13 p. |
article |
5 |
Chinese Postman Problem on edge-colored multigraphs
|
Gutin, Gregory |
|
2017 |
217 |
P2 |
p. 196-202 7 p. |
article |
6 |
Circular-arc hypergraphs: Rigidity via connectedness
|
Köbler, Johannes |
|
2017 |
217 |
P2 |
p. 220-228 9 p. |
article |
7 |
Completely independent spanning trees in some regular graphs
|
Darties, Benoit |
|
2017 |
217 |
P2 |
p. 163-174 12 p. |
article |
8 |
Compositional inverses and complete mappings over finite fields
|
Tuxanidy, Aleksandr |
|
2017 |
217 |
P2 |
p. 318-329 12 p. |
article |
9 |
Contents
|
|
|
2017 |
217 |
P2 |
p. v-vi nvt p. |
article |
10 |
Distance colorings of hypercubes from Z 2 Z 4 -linear codes
|
Matthews, Gretchen L. |
|
2017 |
217 |
P2 |
p. 356-361 6 p. |
article |
11 |
Exploring the complexity of the integer image problem in the max-algebra
|
MacCaig, Marie |
|
2017 |
217 |
P2 |
p. 261-275 15 p. |
article |
12 |
Frustration and isoperimetric inequalities for signed graphs
|
Martin, Florian |
|
2017 |
217 |
P2 |
p. 276-285 10 p. |
article |
13 |
Harmonious colourings of graphs
|
Drgas-Burchardt, Ewa |
|
2017 |
217 |
P2 |
p. 175-184 10 p. |
article |
14 |
h -restricted connectivity of locally twisted cubes
|
Wei, Chia-Chen |
|
2017 |
217 |
P2 |
p. 330-339 10 p. |
article |
15 |
Interval edge-colorings of composition of graphs
|
Tepanyan, H.H. |
|
2017 |
217 |
P2 |
p. 368-374 7 p. |
article |
16 |
Many-to-many disjoint paths in hypercubes with faulty vertices
|
Li, Xiang-Jun |
|
2017 |
217 |
P2 |
p. 229-242 14 p. |
article |
17 |
Nonexistence of a few binary orthogonal arrays
|
Boyvalenkov, Peter |
|
2017 |
217 |
P2 |
p. 144-150 7 p. |
article |
18 |
On a directed variation of the 1-2-3 and 1-2 Conjectures
|
Barme, Emma |
|
2017 |
217 |
P2 |
p. 123-131 9 p. |
article |
19 |
On derivatives of polynomials over finite fields through integration
|
Pasalic, E. |
|
2017 |
217 |
P2 |
p. 294-303 10 p. |
article |
20 |
On-line list coloring of matroids
|
Lasoń, Michał |
|
2017 |
217 |
P2 |
p. 353-355 3 p. |
article |
21 |
On semidefinite least squares and minimal unsatisfiability
|
Anjos, Miguel F. |
|
2017 |
217 |
P2 |
p. 79-96 18 p. |
article |
22 |
Q -Factorization of suffixes of two-way infinite extensions of irrational characteristic words
|
Liao, Fang-Yi |
|
2017 |
217 |
P2 |
p. 243-260 18 p. |
article |
23 |
Radio number of trees
|
Bantva, Devsi |
|
2017 |
217 |
P2 |
p. 110-122 13 p. |
article |
24 |
Sharp bounds on the inverse sum indeg index
|
Falahati-Nezhad, Farzaneh |
|
2017 |
217 |
P2 |
p. 185-195 11 p. |
article |
25 |
Size of a phylogenetic network
|
Semple, Charles |
|
2017 |
217 |
P2 |
p. 362-367 6 p. |
article |
26 |
Solving vertex coloring problems as maximum weight stable set problems
|
Cornaz, Denis |
|
2017 |
217 |
P2 |
p. 151-162 12 p. |
article |
27 |
Star-critical Ramsey number of F n versus K 4
|
Haghi, Sh. |
|
2017 |
217 |
P2 |
p. 203-209 7 p. |
article |
28 |
The a -graph coloring problem
|
Tilley, J.A. |
|
2017 |
217 |
P2 |
p. 304-317 14 p. |
article |
29 |
The price of connectivity for feedback vertex set
|
Belmonte, Rémy |
|
2017 |
217 |
P2 |
p. 132-143 12 p. |
article |
30 |
The variation of the Randić index with regard to minimum and maximum degree
|
Milivojević, Milica |
|
2017 |
217 |
P2 |
p. 286-293 8 p. |
article |
31 |
Upper bounds for the achromatic and coloring numbers of a graph
|
Wu, Baoyindureng |
|
2017 |
217 |
P2 |
p. 375-380 6 p. |
article |