Digital Library
Close Browse articles from a journal
 
Search for with title:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

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