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
 
                             90 results found
no title author magazine year volume issue page(s) type
1 A Characterization of Weakly Bipartite Graphs Guenin, Bertrand
2000
5 C p. 149-151
3 p.
article
2 A Connectivity Lemma Naatz, Michael
2000
5 C p. 247-250
4 p.
article
3 A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös condition Kaneko, Atsushi
2000
5 C p. 198-200
3 p.
article
4 A hypergraph approach to digital fingerprinting Cohen, Gérard
2000
5 C p. 67-70
4 p.
article
5 Approximate Distance Labeling Schemes Gavoille, Cyril
2000
5 C p. 134-137
4 p.
article
6 A procedure of facet composition for the symmetric Traveling Salesman Polytope Nguyen, Viet Hung
2000
5 C p. 251-252
2 p.
article
7 A successful concept for measuring non-planarity of graphs: the crossing number Székely, László A.
2000
5 C p. 284-287
4 p.
article
8 AutoGraphiX: An Automated System for Finding Conjectures in Graph Theory Hansen, Pierre
2000
5 C p. 158-161
4 p.
article
9 Cayley lattices of finite Coxeter groups are bounded Caspard, Nathalie
2000
5 C p. 56-59
4 p.
article
10 Cayley partitionable graphs Pâcher, A.
2000
5 C p. 256-259
4 p.
article
11 Clique-width of countable graphs: a compactness property Courcelle, Bruno
2000
5 C p. 75-76
2 p.
article
12 Clique width of Partner limited graphs Vanherpe, Jean-Marie
2000
5 C p. 303-306
4 p.
article
13 Coding Properties of Breadth-First Search Orderings Ossona de Mendez, P.
2000
5 C p. 253-255
3 p.
article
14 Coloring Planar Toeplitz Graphs Euler, Reinhardt
2000
5 C p. 108-111
4 p.
article
15 3-Colourability and Forbidden Subgraphs Randerath, Bert
2000
5 C p. 270-273
4 p.
article
16 Composition of graphs and the triangle free subgraph polytope Bendali, F.
2000
5 C p. 19-22
4 p.
article
17 Connectivity Augmentation of Graphs Jackson, Bill
2000
5 C p. 185-188
4 p.
article
18 Contractible bonds in Graphs McGuinness, Sean
2000
5 C p. 225-227
3 p.
article
19 Contractible edges in a k-connected graph (K 1 + P 4)-free graph Ando, Kiyoshi
2000
5 C p. 7-10
4 p.
article
20 Coxeter groups through the looking glass: Mirrors and Convexity Crapo, Henry
2000
5 C p. 77-80
4 p.
article
21 Critical graphs for clique-coloring Aider, Meziane
2000
5 C p. 3-6
4 p.
article
22 Digraph representation by its path matrix The particular case of the bipartite graphs Haro, Christophe
2000
5 C p. 162-165
4 p.
article
23 EDGE-CONNECTIVITIES OF GRAPHS AND DIGRAPHS Frank, András
2000
5 C p. 126-129
4 p.
article
24 Exactly k-arc Transitive Covers Mansilla, Sonia P.
2000
5 C p. 321-
1 p.
article
25 Extremal k-edge-hamiltonian Hypergraphs Frankl, Péter
2000
5 C p. 130-133
4 p.
article
26 Finding the chromatic number by means of critical graphs Herrmann, Francine
2000
5 C p. 174-176
3 p.
article
27 Generalized trees related with tree metrics Guénoche, Alain
2000
5 C p. 152-154
3 p.
article
28 General Properties of Some Graphs Defined by Systems of Equations Lazebnik, Felix
2000
5 C p. 206-209
4 p.
article
29 Graph Packings Hell, Pavol
2000
5 C p. 170-173
4 p.
article
30 Graphs with unique dominating sets Fischermann, Miranca
2000
5 C p. 123-125
3 p.
article
31 Hamilton Cycles and Degree Sequences Szeszlér, Dávid
2000
5 C p. 288-290
3 p.
article
32 Hamiltonian cycles of certain kinds of graphs satisfying Dirac condition Yoshimoto, Kiyoshi
2000
5 C p. 315-316
2 p.
article
33 Induced Matchings in Intersection Graphs Cameron, Kathie
2000
5 C p. 50-52
3 p.
article
34 K 6 and icosahedron minors in 5-connected projective planar graphs Fijavž, Gašper
2000
5 C p. 116-119
4 p.
article
35 k-Colouring when k is close to Δ Molloy, Michael
2000
5 C p. 235-238
4 p.
article
36 Laplacian Eigenvalues and multisections Delorme, Charles
2000
5 C p. 93-96
4 p.
article
37 Light subgraphs of multigraphs embedded in compact 2-manifolds Jendrol, Stanislav
2000
5 C p. 189-192
4 p.
article
38 Linear time recognition of Weak bisplit graphs Giakoumakis, Vassilis
2000
5 C p. 138-141
4 p.
article
39 Local Ramsey Numbers for Copies of Cycles Bielak, Halina
2000
5 C p. 23-26
4 p.
article
40 On construction of bound graphs Tsuchiya, Morimasa
2000
5 C p. 299-302
4 p.
article
41 On covers of graphs Jaroslav, Maxová
2000
5 C p. 222-224
3 p.
article
42 On 2-e.c. graphs, tournaments, and hypergraphs Bonato, Anthony
2000
5 C p. 31-34
4 p.
article
43 On Extensions, Linear Extensions, Upsets and Downsets of Ordered Sets (Extended Abstract) Corrâa, Ricardo C.
2000
5 C p. 71-74
4 p.
article
44 On homomorphisms to edge-coloured cycles Brewster, Richard C
2000
5 C p. 46-49
4 p.
article
45 On i-minus-Edge-Removal-critical graphs Cockayne, E.J.
2000
5 C p. 64-66
3 p.
article
46 On min-max theorems in matching theory Szigeti, Zoltán
2000
5 C p. 291-294
4 p.
article
47 On pancyclism of hamiltonian graphs Marczyk, Antoni
2000
5 C p. 218-221
4 p.
article
48 On rank of a matrix associated with graph Dobrynin, Vladimir
2000
5 C p. 100-103
4 p.
article
49 On self-complementary supergraphs of (n, n)-graphs Pawel Wojda, A.
2000
5 C p. 307-310
4 p.
article
50 On Steiner 2-edge connected polytopes Mahjoub, A.R.
2000
5 C p. 210-213
4 p.
article
51 On subgraphs of Cartesian product graphs and S-primeness Breš;ar, Boštjan
2000
5 C p. 42-45
4 p.
article
52 On the structure of graphs with a unique k-factor Johann, Petra
2000
5 C p. 193-195
3 p.
article
53 Orthogonal Drawings Based On The Stratification Of Planar Graphs Bonichon, Nicolas
2000
5 C p. 35-37
3 p.
article
54 Packing of graphs and permutations Woźniak, Mariusz
2000
5 C p. 311-314
4 p.
article
55 Partially Square Graphs, Hamiltonicity and Circumference II Kheddouci, Hamamache
2000
5 C p. 202-205
4 p.
article
56 Partition Designs with two subsets of the Hamming Space Canogar, Roberto
2000
5 C p. 53-55
3 p.
article
57 Perfection, Imperfection, and Graph Entropy Simonyi, Gábor
2000
5 C p. 278-280
3 p.
article
58 Preface Rusu, Irena
2000
5 C p. 1-2
2 p.
article
59 Problems concerning global connectivity of directed graphs Bang-Jensen, Jørgen
2000
5 C p. 15-18
4 p.
article
60 Recognizing Recursive Circulant Graphs (Extended Abstract) Fertin, Guillaume
2000
5 C p. 112-115
4 p.
article
61 Regular factors in regular multipartite graphs Hoffmann, Arne
2000
5 C p. 181-184
4 p.
article
62 Relative Length of Longest Path and Longest Cycle Kawarabayashi, Ken-ichi
2000
5 C p. 201-
1 p.
article
63 Results and Problems Concerning Edge Transformed Graphs Balińska, Krystyna T.
2000
5 C p. 11-14
4 p.
article
64 Rigidity of multi-story buildings Radics, Norbert
2000
5 C p. 263-265
3 p.
article
65 Rotational Cayley Graphs on Transposition Generated Groups Heydemann, Marie-Claude
2000
5 C p. 177-180
4 p.
article
66 “Réseaux réguliers” or regular graphs Gropp, Harald
2000
5 C p. 145-148
4 p.
article
67 Shiftable Intervals Malucelli, F.
2000
5 C p. 214-217
4 p.
article
68 Simpler Projective Plane Embedding Myrvold, Wendy
2000
5 C p. 243-246
4 p.
article
69 Simultaneous Disjoint Routing in Regular Graphs Dogra, Damanpal Singh
2000
5 C p. 104-107
4 p.
article
70 Size Ramsey Numbers Involving Large Stars Pikhurko, Oleg
2000
5 C p. 260-262
3 p.
article
71 Slater orders and Hamiltonian paths of tournaments Charon, Irène
2000
5 C p. 60-63
4 p.
article
72 Solving Problems on Special Classes of Graphs Raghavan, Vijay
2000
5 C p. 266-269
4 p.
article
73 Some medications of Ramsey numbers Gorgol, Izolda
2000
5 C p. 142-144
3 p.
article
74 Some results on graph parameters in weighted graphs Dankelmann, Peter
2000
5 C p. 85-88
4 p.
article
75 Some Results on the Sandglass Conjecture Csákány, Rita
2000
5 C p. 81-84
4 p.
article
76 Some Topological Methods in Graph Coloring Theory Mohar, Bojan
2000
5 C p. 231-234
4 p.
article
77 Split Orders Guenver, Glen-Brag
2000
5 C p. 155-157
3 p.
article
78 Subdivisions, linking, minors, and extremal functions Thomason, Andrew
2000
5 C p. 295-298
4 p.
article
79 The algorithmic theory of treewidth Bodlaender, Hans L.
2000
5 C p. 27-30
4 p.
article
80 The asymptotic number of graphs with a restriction on the maximum degree McKay, Brendan D.
2000
5 C p. 228-230
3 p.
article
81 The graph sandwich problem for 1-join composition is NP-complete de Figueiredo, Celina M.H.
2000
5 C p. 89-92
4 p.
article
82 The lattice of strict completions of a poset Bordalo, G.H.
2000
5 C p. 38-41
4 p.
article
83 The lower domination parameters in inflated graphs Kabanov, Vladislav
2000
5 C p. 196-197
2 p.
article
84 The Simple Chromatic Number of Oriented Graphs Smolikovaa, Petra
2000
5 C p. 281-283
3 p.
article
85 Totally Multicoloured Cycles Montellano-Ballesteros, J.J.
2000
5 C p. 239-242
4 p.
article
86 Total Z-transformation graphs of perfect matching of plane bipartite graphs Zhang, Heping
2000
5 C p. 317-320
4 p.
article
87 Trees in tournaments Havet, Frédéric
2000
5 C p. 166-169
4 p.
article
88 Variations on the theorem of Birkhoff-von Neumann and extensions de Werra, D.
2000
5 C p. 97-99
3 p.
article
89 VLSI Routing in Polynomial Time Recski, András
2000
5 C p. 274-277
4 p.
article
90 Well-located graphs: A collection of well-covered ones Finbow, A.S.
2000
5 C p. 120-122
3 p.
article
                             90 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands