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
 
                             52 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A method for constructing graphs with the same resistance spectrum Xu, Si-Ao

348 2 p.
artikel
2 A note on locating-dominating sets in twin-free graphs Bousquet, Nicolas

348 2 p.
artikel
3 A note on rainbow stackings of random edge-colorings of hypergraphs Gu, Ran

348 2 p.
artikel
4 A note on the lacking polynomial of the complete bipartite graph Alofi, Amal

348 2 p.
artikel
5 A note proving the nullity of block graphs is unbounded Cary, Michael

348 2 p.
artikel
6 A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees Nunes, Igor

348 2 p.
artikel
7 Bipartite Ramsey number pairs that involve combinations of cycles and odd paths Joubert, Ernst J.

348 2 p.
artikel
8 Bounding the intersection number c 2 of a distance-regular graph with classical parameters (D,b,α,β) in terms of b Koolen, Jack H.

348 2 p.
artikel
9 Completely regular codes with covering radius 1 and the second eigenvalue in 3-dimensional Hamming graphs Mogilnykh, Ivan

348 2 p.
artikel
10 Counting spanning trees of multiple complete split-like graph containing a given spanning forest Yang, Chenlin

348 2 p.
artikel
11 Cyclic sieving and dihedral sieving on noncrossing (1,2)-configurations Zeng, Chuyi

348 2 p.
artikel
12 Disconnected forbidden pairs force supereulerian graphs to be hamiltonian Wang, Qiang

348 2 p.
artikel
13 Diversity and intersecting theorems for weak compositions Ku, Cheng Yeaw

348 2 p.
artikel
14 Editorial Board
348 2 p.
artikel
15 Equitable coloring in 1-planar graphs Cranston, Daniel W.

348 2 p.
artikel
16 Every 3-connected {K 1,3,Γ3}-free graph is Hamilton-connected Kabela, Adam

348 2 p.
artikel
17 Extremal bounds for pattern avoidance in multidimensional 0-1 matrices Geneson, Jesse

348 2 p.
artikel
18 Fibonacci and Catalan paths in a wall Baril, Jean-Luc

348 2 p.
artikel
19 Generalized Mneimneh sums and their application to multiple polylogarithms Genčev, Marian

348 2 p.
artikel
20 Generation of 3-connected, planar line graphs Hollowbread-Smith, Phoebe

348 2 p.
artikel
21 Graphs with the minimum spectral radius for given independence number Hu, Yarong

348 2 p.
artikel
22 Group divisible designs with block size 4 and group sizes 4 and 10 and some other 4-GDDs Wang, Changyuan

348 2 p.
artikel
23 Large matchings in maximal 1-planar graphs Biedl, Therese

348 2 p.
artikel
24 Linear colouring of binomial random graphs Eide, Austin

348 2 p.
artikel
25 New results on asymmetric orthogonal arrays with strength t ≥ 3 Niu, Xiaodong

348 2 p.
artikel
26 Octopuses in the Boolean cube: Families with pairwise small intersections, part II Kupavskii, Andrey

348 2 p.
artikel
27 On combinatorial and hypergeometric approaches toward second-order difference equations Campbell, John M.

348 2 p.
artikel
28 On finding the largest minimum distance of locally recoverable codes: A graph theory approach Khabbazian, Majid

348 2 p.
artikel
29 On graphs with maximum difference between game chromatic number and chromatic number Hollom, Lawrence

348 2 p.
artikel
30 On the edge-chromatic number of 2-complexes Kurkofka, Jan

348 2 p.
artikel
31 On the inclusion chromatic index of a Halin graph Huang, Ningge

348 2 p.
artikel
32 On the spum and sum-diameter of paths Bora, Aryan

348 2 p.
artikel
33 Oriented posets, rank matrices and q-deformed Markov numbers Kantarcı Oğuz, Ezgi

348 2 p.
artikel
34 Packing directed cycles of specified odd length into digraphs and alternating cycles into bipartite graphs Chiba, Shuya

348 2 p.
artikel
35 Partial packing coloring and quasi-packing coloring of the triangular grid Grochowski, Hubert

348 2 p.
artikel
36 Projective geometries, Q-polynomial structures, and quantum groups Terwilliger, Paul

348 2 p.
artikel
37 Refinements of degree conditions for the existence of a spanning tree without small degree stems Furuya, Michitaka

348 2 p.
artikel
38 Rigid frameworks with dilation constraints Dewar, Sean

348 2 p.
artikel
39 Six-flows of signed graphs with frustration index three Lu, You

348 2 p.
artikel
40 Stabbing boxes with finitely many axis-parallel lines and flats Chakraborty, Sutanoya

348 2 p.
artikel
41 Star-critical Ramsey numbers involving large books Chen, Xun

348 2 p.
artikel
42 Structural parameters of Schnyder woods Ortlieb, Christian

348 2 p.
artikel
43 Symmetric functions in noncommuting variables in superspace Arcis, Diego

348 2 p.
artikel
44 The average connectivity matrix of a graph Nguyen, Linh

348 2 p.
artikel
45 The decycling number of a line graph Ma, Mingyuan

348 2 p.
artikel
46 The edge coloring of the Cartesian product of signed graphs Wen, Chao

348 2 p.
artikel
47 The Jacobian of a graph and graph automorphisms Estélyi, István

348 2 p.
artikel
48 The Mostar index of Tribonacci cubes Wang, Yu

348 2 p.
artikel
49 Transversal coalitions in hypergraphs Henning, Michael A.

348 2 p.
artikel
50 Truncated theta series related to the Jacobi Triple Product identity Ballantine, Cristina

348 2 p.
artikel
51 Turán numbers and switching Gunderson, Karen

348 2 p.
artikel
52 Weak submodularity implies localizability: Local search for constrained non-submodular function maximization Shi, Majun

348 2 p.
artikel
                             52 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland