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 Acquisition-extremal graphs LeSaulnier, Timothy D.
2013
161 10-11 p. 1521-1529
9 p.
artikel
2 Algorithmic aspects of the k -domination problem in graphs Lan, James K.
2013
161 10-11 p. 1513-1520
8 p.
artikel
3 Alliance free sets in Cartesian product graphs Yero, Ismael G.
2013
161 10-11 p. 1618-1625
8 p.
artikel
4 An efficient algorithm for testing goal-minimality of graphs Gyürki, Štefan
2013
161 10-11 p. 1632-1634
3 p.
artikel
5 An explicit construction of ( 3 , t ) -existentially closed graphs Vinh, Le Anh
2013
161 10-11 p. 1651-1654
4 p.
artikel
6 Antibandwidth and cyclic antibandwidth of Hamming graphs Dobrev, Stefan
2013
161 10-11 p. 1402-1408
7 p.
artikel
7 A superpolynomial lower bound for strategy iteration based on snare memorization Friedmann, Oliver
2013
161 10-11 p. 1317-1337
21 p.
artikel
8 Complexity of the path avoiding forbidden pairs problem revisited Kováč, Jakub
2013
161 10-11 p. 1506-1512
7 p.
artikel
9 Computing square roots of trivially perfect and threshold graphs Milanič, Martin
2013
161 10-11 p. 1538-1545
8 p.
artikel
10 Connectivity of Kronecker products with complete multipartite graphs Wang, Wei
2013
161 10-11 p. 1655-1659
5 p.
artikel
11 Contents 2013
161 10-11 p. v-vii
nvt p.
artikel
12 Diffuse reflection diameter and radius for convex-quadrilateralizable polygons Khan, Arindam
2013
161 10-11 p. 1496-1505
10 p.
artikel
13 Domination game: Extremal families of graphs for 3 / 5 -conjectures Brešar, Boštjan
2013
161 10-11 p. 1308-1316
9 p.
artikel
14 Edge contraction and edge removal on iterated clique graphs Frías-Armenta, M.E.
2013
161 10-11 p. 1427-1439
13 p.
artikel
15 Fast algorithms for finding a minimum repetition representation of strings and trees Nakamura, Atsuyoshi
2013
161 10-11 p. 1556-1575
20 p.
artikel
16 Fork-forests in bi-colored complete bipartite graphs Axenovich, Maria
2013
161 10-11 p. 1363-1366
4 p.
artikel
17 Four-regular graphs with rigid vertices associated to DNA recombination Burns, Jonathan
2013
161 10-11 p. 1378-1394
17 p.
artikel
18 Hamiltonian claw-free graphs involving minimum degrees Li, MingChu
2013
161 10-11 p. 1530-1537
8 p.
artikel
19 Homogeneously non-idling schedules of unit-time jobs on identical parallel machines Quilliot, Alain
2013
161 10-11 p. 1586-1597
12 p.
artikel
20 How much is it worth to know the future in online conversion problems? Mohr, Esther
2013
161 10-11 p. 1546-1555
10 p.
artikel
21 Information diffusion on the iterated local transitivity model of online social networks Small, Lucy
2013
161 10-11 p. 1338-1344
7 p.
artikel
22 Injectivity and weak ternary separation Powers, Robert C.
2013
161 10-11 p. 1646-1650
5 p.
artikel
23 Iterated open neighborhood graphs and generalizations Schweitzer, Pascal
2013
161 10-11 p. 1598-1609
12 p.
artikel
24 List injective coloring of planar graphs with girth 5, 6, 8 Bu, Yuehua
2013
161 10-11 p. 1367-1377
11 p.
artikel
25 Obtaining splits from cut sets of tight spans Dress, Andreas
2013
161 10-11 p. 1409-1420
12 p.
artikel
26 On generalized zero divisor graph of a poset Joshi, Vinayak
2013
161 10-11 p. 1490-1495
6 p.
artikel
27 On hypercube labellings and antipodal monochromatic paths Feder, Tomás
2013
161 10-11 p. 1421-1426
6 p.
artikel
28 On k -domination and j -independence in graphs Hansberg, Adriana
2013
161 10-11 p. 1472-1480
9 p.
artikel
29 On maximum matchings in König–Egerváry graphs Levit, Vadim E.
2013
161 10-11 p. 1635-1638
4 p.
artikel
30 On 4- γ t -critical graphs of diameter two Wang, Yan
2013
161 10-11 p. 1660-1668
9 p.
artikel
31 On the contour of graphs Artigas, D.
2013
161 10-11 p. 1356-1362
7 p.
artikel
32 On the metric dimension, the upper dimension and the resolving number of graphs Garijo, Delia
2013
161 10-11 p. 1440-1447
8 p.
artikel
33 On the number of update digraphs and its relation with the feedback arc sets and tournaments Aracena, J.
2013
161 10-11 p. 1345-1355
11 p.
artikel
34 On the polygonal diameter (=  link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane Perles, Micha A.
2013
161 10-11 p. 1576-1585
10 p.
artikel
35 Rainbow domination and related problems on strongly chordal graphs Chang, Gerard J.
2013
161 10-11 p. 1395-1401
7 p.
artikel
36 Restricted arc-connectivity in tournaments Grüter, Steffen
2013
161 10-11 p. 1467-1471
5 p.
artikel
37 Signless Laplacian eigenvalues and circumference of graphs Wang, JianFeng
2013
161 10-11 p. 1610-1617
8 p.
artikel
38 Simple agents learn to find their way: An introduction on mapping polygons Chalopin, Jérémie
2013
161 10-11 p. 1287-1307
21 p.
artikel
39 Small cutsets in arc-transitive digraphs of prime degree López, S.C.
2013
161 10-11 p. 1639-1645
7 p.
artikel
40 The (conditional) matching preclusion for burnt pancake graphs Hu, Xiaolan
2013
161 10-11 p. 1481-1489
9 p.
artikel
41 The distribution of cycles in breakpoint graphs of signed permutations Grusea, Simona
2013
161 10-11 p. 1448-1466
19 p.
artikel
42 The parametric complexity of graph diameter augmentation Gao, Yong
2013
161 10-11 p. 1626-1631
6 p.
artikel
43 Unimodality and log-concavity of f -vectors for cyclic and ordinary polytopes Major, László
2013
161 10-11 p. 1669-1672
4 p.
artikel
                             43 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland