nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A counterexample to a conjecture on facial unique-maximal colorings
|
Lidický, Bernard |
|
2018 |
237 |
C |
p. 123-125 |
artikel |
2 |
A kind of conditional connectivity of transposition networks generated by k -trees
|
Yang, Weihua |
|
2018 |
237 |
C |
p. 132-138 |
artikel |
3 |
A new class of optimal linear codes with flexible parameters
|
Luo, Gaojun |
|
2018 |
237 |
C |
p. 126-131 |
artikel |
4 |
( d , n ) -packing colorings of infinite lattices
|
Korže, Danilo |
|
2018 |
237 |
C |
p. 97-108 |
artikel |
5 |
Editorial Board
|
|
|
2018 |
237 |
C |
p. ii |
artikel |
6 |
Infection in hypergraphs
|
Bergen, Ryan |
|
2018 |
237 |
C |
p. 43-56 |
artikel |
7 |
Maximum weight independent set for ℓ claw-free graphs in polynomial time
|
Brandstädt, Andreas |
|
2018 |
237 |
C |
p. 57-64 |
artikel |
8 |
Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
|
Lu, You |
|
2018 |
237 |
C |
p. 109-115 |
artikel |
9 |
New sufficient conditions for strong unimodality of multivariate discrete distributions
|
Alharbi, Majed Ghazi |
|
2018 |
237 |
C |
p. 1-25 |
artikel |
10 |
On facial unique-maximum (edge-)coloring
|
Andova, Vesna |
|
2018 |
237 |
C |
p. 26-32 |
artikel |
11 |
r -hued coloring of sparse graphs
|
Cheng, Jian |
|
2018 |
237 |
C |
p. 75-81 |
artikel |
12 |
Singularities in Negami’s splitting formula for the Tutte polynomial
|
Burgos, J.M. |
|
2018 |
237 |
C |
p. 65-74 |
artikel |
13 |
The convexity of induced paths of order three and applications: Complexity aspects
|
Araújo, Rafael T. |
|
2018 |
237 |
C |
p. 33-42 |
artikel |
14 |
The matcher game played in graphs
|
Goddard, Wayne |
|
2018 |
237 |
C |
p. 82-88 |
artikel |
15 |
The minimum size of graphs satisfying cut conditions
|
Jobson, Adam S. |
|
2018 |
237 |
C |
p. 89-96 |
artikel |
16 |
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
|
Furmańczyk, Hanna |
|
2018 |
237 |
C |
p. 116-122 |
artikel |