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
 
                             43 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 A heuristic approach for searching ( d , n ) -packing colorings of infinite lattices Korže, Danilo
2019
257 C p. 353-358
artikel
2 An algorithm which outputs a graph with a specified chromatic factor Delbourgo, Daniel
2019
257 C p. 128-150
artikel
3 An easy counting lemma Engelhardt, Matthias R.
2019
257 C p. 175-185
artikel
4 A note on b-coloring of Kneser graphs Shaebani, Saeed
2019
257 C p. 368-369
artikel
5 A note on the dispersion of admissible lattices Ullrich, Mario
2019
257 C p. 385-387
artikel
6 Antimatroids induced by matchings Kawase, Yasushi
2019
257 C p. 342-349
artikel
7 A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs Bensmail, Julien
2019
257 C p. 31-39
artikel
8 2-bisections in claw-free cubic multigraphs Cui, Qing
2019
257 C p. 325-330
artikel
9 Conditional connectivity of folded hypercubes Zhao, Shuli
2019
257 C p. 388-392
artikel
10 Critical vertices and edges in H -free graphs Paulusma, Daniël
2019
257 C p. 361-367
artikel
11 Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs Brignall, Robert
2019
257 C p. 60-66
artikel
12 Degree sum and graph linkage with prescribed path lengths Coll, Vincent E.
2019
257 C p. 85-94
artikel
13 Editorial Board 2019
257 C p. ii
artikel
14 Effect of predomination and vertex removal on the game total domination number of a graph Iršič, Vesna
2019
257 C p. 216-225
artikel
15 Equivalent versions of group-connectivity theorems and conjectures Kochol, Martin
2019
257 C p. 350-352
artikel
16 Extremal polygonal cacti for bond incident degree indices Ye, Jiachang
2019
257 C p. 289-298
artikel
17 Facial packing vertex-coloring of subdivided plane graphs Czap, Július
2019
257 C p. 95-100
artikel
18 Finding cut-vertices in the square roots of a graph Ducoffe, Guillaume
2019
257 C p. 158-174
artikel
19 Forcing brushes Meierling, D.
2019
257 C p. 359-360
artikel
20 Hamilton cycles in sparse locally connected graphs van Aardt, Susan A.
2019
257 C p. 276-288
artikel
21 Hamiltonian cycles and paths in faulty twisted hypercubes Liu, Huiqing
2019
257 C p. 243-249
artikel
22 Infinite family of 3-connected cubic transmission irregular graphs Dobrynin, Andrey A.
2019
257 C p. 151-157
artikel
23 Local antimagic orientations of d -degenerate graphs Hu, Jie
2019
257 C p. 206-215
artikel
24 Lower bounds for the geometric–arithmetic index of graphs with pendant and fully connected vertices Bianchi, Monica
2019
257 C p. 53-59
artikel
25 Maximum external Wiener index of graphs Dimitrov, Darko
2019
257 C p. 331-337
artikel
26 Minor stars in plane graphs with minimum degree five Li, Yangfan
2019
257 C p. 233-242
artikel
27 Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs Gu, Qian-Ping
2019
257 C p. 186-205
artikel
28 On graphs with the maximum edge metric dimension Zhu, Enqiang
2019
257 C p. 317-324
artikel
29 On maximum k -edge-colorable subgraphs of bipartite graphs Karapetyan, Liana
2019
257 C p. 226-232
artikel
30 On 2-rainbow domination of generalized Petersen graphs Shao, Zehui
2019
257 C p. 370-384
artikel
31 On spectrum assignment in elastic optical tree-networks Bermond, Jean-Claude
2019
257 C p. 40-52
artikel
32 On the extremal graphs for general sum-connectivity index ( χ α ) with given cyclomatic number when α > 1 Ali, Akbar
2019
257 C p. 19-30
artikel
33 On the total forcing number of a graph Davila, Randy
2019
257 C p. 115-127
artikel
34 Paired-domination in claw-free graphs with minimum degree at least three Lu, Changhong
2019
257 C p. 250-259
artikel
35 Partitions of multigraphs under minimum degree constraints Schweser, Thomas
2019
257 C p. 269-275
artikel
36 Resistance between two vertices of almost complete bipartite graphs Ye, Luzh
2019
257 C p. 299-305
artikel
37 Signed double Roman domination in graphs Ahangar, Hossein Abdollahzadeh
2019
257 C p. 1-11
artikel
38 Spectral characterization of the complete graph removing a path of small length Mao, Lihuan
2019
257 C p. 260-268
artikel
39 Sum of weighted distances in trees Cai, Qingqiong
2019
257 C p. 67-84
artikel
40 The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets Dannenberg, Katharina
2019
257 C p. 101-114
artikel
41 The joint weight enumerator of an LCD code and its dual Alahmadi, Adel
2019
257 C p. 12-18
artikel
42 Two kinds of generalized connectivity of dual cubes Zhao, Shu-Li
2019
257 C p. 306-316
artikel
43 Upper bounds on the locating chromatic number of trees Furuya, Michitaka
2019
257 C p. 338-341
artikel
                             43 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland