Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             64 results found
no title author magazine year volume issue page(s) type
1 A 3 4 -approximation of Vizing’s conjecture for claw-free graphs Brešar, Boštjan

284 C p. 416-422
article
2 Adynamic coloring of graphs Šurimová, Mária

284 C p. 224-233
article
3 Burning number of caterpillars Liu, Huiqing

284 C p. 332-340
article
4 Complexity aspects of ℓ -chord convexities Dourado, Mitre C.

284 C p. 585-591
article
5 Complexity of planar signed graph homomorphisms to cycles Dross, François

284 C p. 166-178
article
6 1-2-3 Conjecture in digraphs: More results and directions Bensmail, Julien

284 C p. 124-137
article
7 Connected greedy coloring of H -free graphs Mota, Esdras

284 C p. 572-584
article
8 Constructive characterizations concerning weak Roman domination in trees Cabrera-Martínez, Abel

284 C p. 384-390
article
9 Corrigendum to “On strongly regular signed graphs” [Discrete Applied Mathematics 271 (2019) 184–190] Stanić, Zoran

284 C p. 640
article
10 Cube-free resonance graphs Che, Zhongyuan

284 C p. 262-268
article
11 Cycle energy and its size dependence Gutman, Ivan

284 C p. 534-537
article
12 Decomposing a graph into shortest paths with bounded eccentricity Birmelé, Etienne

284 C p. 353-374
article
13 Domination and location in twin-free digraphs Foucaud, Florent

284 C p. 42-52
article
14 Double domination in lexicographic product graphs Cabrera Martínez, Abel

284 C p. 290-300
article
15 Dynamic programming bi-criteria combinatorial optimization Mankowski, Michal

284 C p. 513-533
article
16 Edge decomposition of connected claw-free cubic graphs Hong, Yanmei

284 C p. 246-250
article
17 Editorial Board
284 C p. ii
article
18 Efficient design methods of low-weight correlation-immune functions and revisiting their basic characterization Kudin, S.

284 C p. 150-157
article
19 Enumeration and extensions of word-representants Gaetz, Marisa

284 C p. 423-433
article
20 Extremal trees of given segment sequence with respect to some eccentricity-based invariants Zhang, Minjie

284 C p. 111-123
article
21 Finding dominating induced matchings in S 1 , 1 , 5 -free graphs in polynomial time Brandstädt, Andreas

284 C p. 269-280
article
22 Finding non-minority balls with majority and plurality queries Chang, Huilan

284 C p. 631-639
article
23 General eccentric connectivity index of trees and unicyclic graphs Vetrík, Tomáš

284 C p. 301-315
article
24 Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs Bessy, Stéphane

284 C p. 195-200
article
25 Grundy dominating sequences on X -join product Nasini, Graciela

284 C p. 138-149
article
26 How to build a graph in n days: Some variations of graph assembly Dougherty, Aria L.

284 C p. 20-28
article
27 Independent ( k + 1 ) -domination in k -trees Borowiecki, Mieczysław

284 C p. 99-110
article
28 Interval robustness of (interval) max-plus matrices Myšková, Helena

284 C p. 8-19
article
29 L ( p , q ) -labeling of planar graphs with small girth Dong, Wei

284 C p. 592-601
article
30 Maximum nullity and zero forcing number on graphs with maximum degree at most three Alishahi, Meysam

284 C p. 179-194
article
31 Metric dimension and pattern avoidance in graphs Geneson, Jesse

284 C p. 1-7
article
32 Minor-obstructions for apex sub-unicyclic graphs Leivaditis, Alexandros

284 C p. 538-555
article
33 Multilevel secret sharing schemes arising from the normal rational curve Caputo, Stefania

284 C p. 158-165
article
34 Non-hamiltonian 1-tough triangulations with disjoint separating triangles Fujisawa, Jun

284 C p. 622-625
article
35 Normalized Laplacian spectrum of complete multipartite graphs Sun, Shaowei

284 C p. 234-245
article
36 On coloring the arcs of biregular graphs Dejter, Italo J.

284 C p. 489-498
article
37 On energy and Laplacian energy of chain graphs Das, Kinkar Chandra

284 C p. 391-400
article
38 On highly palindromic words: The ternary case Ago, Kristina

284 C p. 434-443
article
39 On k -rainbow domination in regular graphs Kuzman, Boštjan

284 C p. 454-464
article
40 On matroid parity and matching polytopes Kaparis, Konstantinos

284 C p. 322-331
article
41 On the degree Kirchhoff index of unicyclic graphs Qi, Xuli

284 C p. 86-98
article
42 On the edge-Szeged index of unicyclic graphs with perfect matchings He, Shengjie

284 C p. 207-223
article
43 On the extremal values of the eccentric distance sum of trees with a given maximum degree Miao, Lianying

284 C p. 375-383
article
44 On the number of almost envy-free allocations Suksompong, Warut

284 C p. 606-610
article
45 Perfect double Roman domination of trees Egunjobi, Ayotunde T.

284 C p. 71-85
article
46 Planar graphs without short even cycles are near-bipartite Liu, Runrun

284 C p. 626-630
article
47 Power domination in regular claw-free graphs Lu, Changhong

284 C p. 401-415
article
48 Restricted matching in plane triangulations and near triangulations Aldred, R.E.L.

284 C p. 251-261
article
49 Signed analogue of general Kotzig–Lovász decomposition Kita, Nanao

284 C p. 61-70
article
50 Some notes on the extremal k -generalized quasi-unicyclic graphs with respect to Zagreb indices Liu, Muhuo

284 C p. 616-621
article
51 Spanning 2-forests and resistance distance in 2-connected graphs Barrett, Wayne

284 C p. 341-352
article
52 Spectral characterization of the complete graph removing a path Liu, Muhuo

284 C p. 499-512
article
53 Stack words and a bound for 3-stack sortable permutations Bóna, Miklós

284 C p. 602-605
article
54 Strong chromatic index of K 1 , t -free graphs Dębski, Michał

284 C p. 53-60
article
55 Structure connectivity and substructure connectivity of star graphs Li, Chunfang

284 C p. 472-480
article
56 The asymptotic value of graph energy for random graphs with degree-based weights Li, Xueliang

284 C p. 481-488
article
57 The generalized matcher game Bachstein, Anna

284 C p. 444-453
article
58 The Hamming distances of repeated-root cyclic codes of length 5 p s Li, Xia

284 C p. 29-41
article
59 The harmonic index of a graph and its DP-chromatic number Lv, Jian-Bo

284 C p. 611-615
article
60 The iterated local model for social networks Bonato, Anthony

284 C p. 556-571
article
61 The preclusion numbers and edge preclusion numbers in a class of Cayley graphs Zhang, Guozhen

284 C p. 465-471
article
62 The target location function on finite trees Leach, Trevor

284 C p. 316-321
article
63 Toughness and prism-hamiltonicity of P 4 -free graphs Ellingham, M.N.

284 C p. 201-206
article
64 Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs Cordero-Michel, Narda

284 C p. 281-289
article
                             64 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands