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
 
                             48 results found
no title author magazine year volume issue page(s) type
1 A Conjecture of Borodin and a Coloring of Grünbaum Rautenbach, Dieter
 2006
 24 C p. 187-194
8 p.
 article
2 A discrete structure with the minimal set Rycerz, Anna
 2006
 24 C p. 199-202
4 p.
 article
3 A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree Lepin, V.V.
 2006
 24 C p. 111-116
6 p.
 article
4 Antibandwidth of Complete k-Ary Trees Calamoneri, Tiziana
 2006
 24 C p. 259-266
8 p.
 article
5 Automorphisms group of generalized Hamming Graphs Affif Chaouche, F.
 2006
 24 C p. 9-15
7 p.
 article
6 Computing an irregularity strength of selected graphs Meissner, Adam
 2006
 24 C p. 137-144
8 p.
 article
7 Decomposition of complete bipartite graphs into open trails Cichacz, Sylwia
 2006
 24 C p. 53-55
3 p.
 article
8 Decompositions of Snarks into Repeated Dot-Products Chladný, Miroslav
 2006
 24 C p. 215-222
8 p.
 article
9 Divisibility conditions in almost Moore digraphs with selfrepeats Teska, Jakub
 2006
 24 C p. 161-163
3 p.
 article
10 Expected value of the minimal basis of random matroid and distributions of q-analogs of order statistics Kordecki, Wojciech
 2006
 24 C p. 117-123
7 p.
 article
11 Greedy defining sets in graphs and Latin squares Zaker, Manouchehr
 2006
 24 C p. 299-302
4 p.
 article
12 Hamiltonian graphs from Kirkman to König Gropp, Harald
 2006
 24 C p. 81-88
8 p.
 article
13 Hamiltonicity and pancyclicity of generalized prisms Flandrin, Evelyne
 2006
 24 C p. 61-67
7 p.
 article
14 Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6 Máčajová, Edita
 2006
 24 C p. 125-132
8 p.
 article
15 Isometric embedding of subdivided Connected graphs in the hypercube Aïder, Méziane
 2006
 24 C p. 145-151
7 p.
 article
16 Long cycles in graphs and digraphs Adamus, Lech
 2006
 24 C p. 3-7
5 p.
 article
17 Marking Games Sidorowicz, Elżbieta
 2006
 24 C p. 211-214
4 p.
 article
18 Maximal Binary Cliques Kuchta, Małgorzata
 2006
 24 C p. 237-241
5 p.
 article
19 Mixed colorings of hypergraphs Bujtás, Csilla
 2006
 24 C p. 273-275
3 p.
 article
20 Nested Graphs Korenblit, Mark
 2006
 24 C p. 93-99
7 p.
 article
21 New Largest Graphs of Diameter 6 Pineda-Villavicencio, Guillermo
 2006
 24 C p. 153-160
8 p.
 article
22 On chromatic polynomials of hypergraphs Drgas-Burchardt, Ewa
 2006
 24 C p. 105-110
6 p.
 article
23 On double bound graphs and forbidden subposets Ogawa, Kenjiro
 2006
 24 C p. 267-271
5 p.
 article
24 One–factorizations of complete graphs with regular automorphism groups Rinaldi, Gloria
 2006
 24 C p. 195-198
4 p.
 article
25 On 2-factorizations with some symmetry Mazzuoccolo, Giuseppe
 2006
 24 C p. 133-135
3 p.
 article
26 On isomorphic linear partitions in cubic graphs Fouquet, J.-L.
 2006
 24 C p. 277-284
8 p.
 article
27 On k-chromatically unique and k-chromatically equivalent hypergraphs Drgas-Burchardt, Ewa
 2006
 24 C p. 57-60
4 p.
 article
28 On neighbour-distinguishing colourings from lists Horňák, Mirko
 2006
 24 C p. 295-297
3 p.
 article
29 On Page Number of N-free Posets Kwiatkowska, Anna Beata
 2006
 24 C p. 243-249
7 p.
 article
30 On perfectly one–factorable cubic graphs Bonvicini, Simona
 2006
 24 C p. 47-51
5 p.
 article
31 On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles Skupień, Zdzisław
 2006
 24 C p. 231-235
5 p.
 article
32 On the first unknown value of the function g ( v ) Olszewska, Daria
 2006
 24 C p. 181-185
5 p.
 article
33 On the problem of domino recognition Krylou, Y.V.
 2006
 24 C p. 251-258
8 p.
 article
34 On the total domination critical graphs Mojdeh, Doost Ali
 2006
 24 C p. 89-92
4 p.
 article
35 Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph Benediktovich, V.I.
 2006
 24 C p. 31-38
8 p.
 article
36 Preface Meszka, Mariusz
 2006
 24 C p. 1-
1 p.
 article
37 Rainbow numbers for certain graphs Gorgol, Izolda
 2006
 24 C p. 77-79
3 p.
 article
38 Self-complementary hypergraphs and their self-complementing permutations Szymański, Artur
 2006
 24 C p. 291-294
4 p.
 article
39 Size Ramsey numbers for some regular graphs Bielak, Halina
 2006
 24 C p. 39-45
7 p.
 article
40 Small separations in vertex-transitive graphs DeVos, Matt
 2006
 24 C p. 165-172
8 p.
 article
41 Some results on placing bipartite graphs of maximum degree two Orchel, Beata
 2006
 24 C p. 285-289
5 p.
 article
42 Some structural, metric and convex properties on the boundary of a graph Hernando, Carmen
 2006
 24 C p. 203-209
7 p.
 article
43 Some Theorems on Detachments Preserving Local-Edge-Connectivity Fukunaga, Takuro
 2006
 24 C p. 173-180
8 p.
 article
44 Squares of Intersection Graphs and Induced Matchings Orlovich, Yu.L.
 2006
 24 C p. 223-230
8 p.
 article
45 Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph Ando, Kiyoshi
 2006
 24 C p. 25-30
6 p.
 article
46 The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs Kužel, Roman
 2006
 24 C p. 101-104
4 p.
 article
47 The structure and unlabelled enumeration of toroidal graphs with no K 3,3's Gagarin, Andrei
 2006
 24 C p. 69-76
8 p.
 article
48 Using Double-Loop digraphs for solving Frobenius' Problems Aguiló-Gost, F.
 2006
 24 C p. 17-24
8 p.
 article
                             48 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands