Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             19 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A characterization of graphs with regular distance-2 graphs Gaar, Elisabeth

324 C p. 181-218
artikel
2 Algorithms for the clique problem with multiple-choice constraints under a series–parallel dependency graph Bärmann, Andreas

324 C p. 145-166
artikel
3 Balanced odd-variable rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity Guo, Fei

324 C p. 18-28
artikel
4 Disproof of a conjecture on the rainbow triangles in arc-colored digraphs Yang, Wei

324 C p. 99-102
artikel
5 Editorial Board
324 C p. ii
artikel
6 Flexing infinite frameworks with applications to braced Penrose tilings Dewar, Sean

324 C p. 1-17
artikel
7 Lower bounds on the irregularity of trees and unicyclic graphs Azari, Mahdieh

324 C p. 136-144
artikel
8 Minimal obstructions for a matrix partition problem in chordal graphs García-Altamirano, Juan Carlos

324 C p. 58-66
artikel
9 Multilinear sets with two monomials and cardinality constraints Chen, Rui

324 C p. 67-79
artikel
10 Neighbor connectivity of pancake graphs and burnt pancake graphs Gu, Mei-Mei

324 C p. 46-57
artikel
11 On clique numbers of colored mixed graphs Chakraborty, Dipayan

324 C p. 29-40
artikel
12 Probabilistic chip-collecting games with modulo winning conditions Harrington, Joshua

324 C p. 93-98
artikel
13 Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods Fabrici, Igor

324 C p. 80-92
artikel
14 Shortened universal cycles for permutations Kirsch, Rachel

324 C p. 219-228
artikel
15 Some notes on disjunctive short sum: polychromatic nim Carvalho, Alda

324 C p. 113-125
artikel
16 Some tight bounds on the minimum and maximum forcing numbers of graphs Liu, Qianqian

324 C p. 126-135
artikel
17 Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes Xu, Liqiong

324 C p. 41-45
artikel
18 The complexity of gerrymandering over graphs: Paths and trees Bentert, Matthias

324 C p. 103-112
artikel
19 The feasibility problem for line graphs Caro, Yair

324 C p. 167-180
artikel
                             19 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland