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
 
                             100 results found
no title author magazine year volume issue page(s) type
1 Abelian Colourings of Cubic Graphs Máčajová, Edita
 2005
 22 C p. 333-339
7 p.
 article
2 About Counterexamples to The 5-Flow Conjecture Kochol, Martin
 2005
 22 C p. 21-24
4 p.
 article
3 Algorithms for 3PC(⋅, ⋅)-free Berge graphs Maffray, Frédéric
 2005
 22 C p. 73-77
5 p.
 article
4 Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks Bogdanowicz, Z.R.
 2005
 22 C p. 1-5
5 p.
 article
5 An Ore-type condition for arbitrarily vertex decomposable graphs Marczyk, Antoni
 2005
 22 C p. 477-480
4 p.
 article
6 A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product Ille, Pierre
 2005
 22 C p. 91-92
2 p.
 article
7 A Random Graph Model of Mobile Wireless Networks Tyrakowski, Tomasz
 2005
 22 C p. 311-314
4 p.
 article
8 A representation for the modular-pairs of a P 4-reducible graph by modular decomposition dos Santos, Noemi C.
 2005
 22 C p. 267-270
4 p.
 article
9 Around Wythoff's game Duchêne, Eric
 2005
 22 C p. 167-172
6 p.
 article
10 AutoGraphiX: a survey Aouchiche, M.
 2005
 22 C p. 515-520
6 p.
 article
11 Bicolored matchings in some classes of graphs Costa, M.-C.
 2005
 22 C p. 207-211
5 p.
 article
12 Characterization and recognition of Helly circular-arc clique-perfect graphs Bonomo, Flavia
 2005
 22 C p. 147-150
4 p.
 article
13 Characterizing ( k , l ) –partitionable Cographs de Souza Francisco, Raquel
 2005
 22 C p. 277-280
4 p.
 article
14 Circulant graphs: efficient recognizing and isomorphism testing Evdokimov, Sergei
 2005
 22 C p. 7-12
6 p.
 article
15 Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs Li, MingChu
 2005
 22 C p. 93-99
7 p.
 article
16 Claw-free graphs with non-clique μ-subgraphs and related geometries Vakula, Igor
 2005
 22 C p. 29-31
3 p.
 article
17 Codes Identifying Vertices in Graphs Moncel, Julien
 2005
 22 C p. 229-232
4 p.
 article
18 Coloring Meyniel graphs in linear time Lévêque, Benjamin
 2005
 22 C p. 25-28
4 p.
 article
19 Coloring the Cartesian Sum of Graphs Liu, Daphne
 2005
 22 C p. 305-309
5 p.
 article
20 Colouring Some Classes of Perfect Graphs Robustly Cameron, Kathie
 2005
 22 C p. 553-556
4 p.
 article
21 Comparing recent methods in graph partitioning Guénoche, A.
 2005
 22 C p. 83-89
7 p.
 article
22 Connected Graph Searching in Outerplanar Graphs Fomin, Fedor V.
 2005
 22 C p. 213-216
4 p.
 article
23 Cover Pebbling Thresholds for the Complete Graph Godbole, Anant P.
 2005
 22 C p. 301-304
4 p.
 article
24 Crossing Minimisation Heuristics for 2-page Drawings He, Hongmei
 2005
 22 C p. 527-534
8 p.
 article
25 Degree Conditions and Degree Bounded Trees Matsumura, Hajime
 2005
 22 C p. 295-298
4 p.
 article
26 Distance Labeling for Permutation Graphs Bazzaro, Fabrice
 2005
 22 C p. 461-467
7 p.
 article
27 Edge Addition Number of Cartesian Product of Paths and Cycles Lai, Yung-Ling
 2005
 22 C p. 439-444
6 p.
 article
28 Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs Bentz, Cédric
 2005
 22 C p. 55-60
6 p.
 article
29 Edge Disjoint Paths of Increasing Order in Complete Bipartite Graphs Hamburger, Peter
 2005
 22 C p. 61-67
7 p.
 article
30 Edge intersection graphs of linear 3-uniform hypergraphs Skums, P.V.
 2005
 22 C p. 33-40
8 p.
 article
31 Edge-maximal graphs of branchwidth k Paul, Christophe
 2005
 22 C p. 363-368
6 p.
 article
32 Edge Partition of Toroidal Graphs into Forests in Linear Time Bonichon, Nicolas
 2005
 22 C p. 421-425
5 p.
 article
33 Embedding some hierarchical caterpillars into hypercube Sunitha, V.
 2005
 22 C p. 387-389
3 p.
 article
34 Every Monotone 3-Graph Property is Testable Avart, Christian
 2005
 22 C p. 539-542
4 p.
 article
35 Existence and colouring of configurations with line size k = 4 Gropp, Harald
 2005
 22 C p. 487-490
4 p.
 article
36 Extremities and orderings defined by generalized graph search algorithms Berry, Anne
 2005
 22 C p. 413-420
8 p.
 article
37 Faithful extensions on finite orders classes Guillet, Alain
 2005
 22 C p. 383-386
4 p.
 article
38 Forbidden minors and subdivisions for toroidal graphs with no K 3,3's Gagarin, Andrei
 2005
 22 C p. 151-156
6 p.
 article
39 Fractional covering by cuts Šámal, Robert
 2005
 22 C p. 455-459
5 p.
 article
40 Graph decompositions definable in monadic second-order logic Courcelle, Bruno
 2005
 22 C p. 13-19
7 p.
 article
41 Graph decompositions for cartesian products Djelloul, Selma
 2005
 22 C p. 375-381
7 p.
 article
42 Hamiltonian cycles and paths through matchings Amar, Denise
 2005
 22 C p. 543-547
5 p.
 article
43 Heavy cycles in weighted graphs Fujisawa, Jun
 2005
 22 C p. 195-199
5 p.
 article
44 Helly Property and Sandwich Graphs Dourado, Mitre C.
 2005
 22 C p. 497-500
4 p.
 article
45 Homogeneously almost self-complementary graphs Šajna, Mateja
 2005
 22 C p. 291-294
4 p.
 article
46 Improper Colourings of Unit Disk Graphs Havet, F.
 2005
 22 C p. 123-128
6 p.
 article
47 2K 2-Partition Problem Campos, C.N.
 2005
 22 C p. 217-221
5 p.
 article
48 2-local distributed algorithms for generalized coloring of hexagonal graphs Šparl, Petra
 2005
 22 C p. 321-325
5 p.
 article
49 Loop Graphs and Asteroidal Sets Alcón, Liliana
 2005
 22 C p. 179-183
5 p.
 article
50 Minimum cycle bases of graphs over different fields Horton, Joseph D.
 2005
 22 C p. 501-505
5 p.
 article
51 Mixed covering of trees and the augmentation problem with odd diameter constraints Chepoi, Victor
 2005
 22 C p. 405-408
4 p.
 article
52 New sufficient conditions for the existence of kernels in digraphs Guevara, Mucuy-kak
 2005
 22 C p. 287-290
4 p.
 article
53 Nonrepetitive colorings of graphs Alon, Noga
 2005
 22 C p. 353-355
3 p.
 article
54 Non-zero disjoint cycles in highly connected group labeled graphs Kawarabayashi, Ken-Ichi
 2005
 22 C p. 271-275
5 p.
 article
55 On an extension of distance-hereditary graphs Meslem, Kahina
 2005
 22 C p. 253-259
7 p.
 article
56 On a weighted generalization of α-critical graphs Doignon, Jean-Paul
 2005
 22 C p. 401-404
4 p.
 article
57 On maximum number of minimal dominating sets in graphs Fomin, Fedor V.
 2005
 22 C p. 157-162
6 p.
 article
58 On Posets of Page Number 2 Kwiatkowska, Anna Beata
 2005
 22 C p. 549-552
4 p.
 article
59 On some arboricities in planar graphs Gonçalves, Daniel
 2005
 22 C p. 427-432
6 p.
 article
60 On strongly circular-perfectness Coulonges, Sylvain
 2005
 22 C p. 369-374
6 p.
 article
61 On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of the finite poset Bouchemakh, Isma
 2005
 22 C p. 245-251
7 p.
 article
62 On the metric dimension of some families of graphs Hernando, Carmen
 2005
 22 C p. 129-133
5 p.
 article
63 On the Structure of Identifiable Graphs Charon, Irène
 2005
 22 C p. 491-495
5 p.
 article
64 On the structure of self-complementary graphs Trotignon, Nicolas
 2005
 22 C p. 79-82
4 p.
 article
65 On upper bound graphs with forbidden subposets Era, Hiroshi
 2005
 22 C p. 107-111
5 p.
 article
66 Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings Malucelli, Federico
 2005
 22 C p. 507-513
7 p.
 article
67 Ordered 3-colorings Gupta, A.
 2005
 22 C p. 299-300
2 p.
 article
68 Oriented Forests in Directed Graphs Sobhan Babu, Ch.
 2005
 22 C p. 141-145
5 p.
 article
69 Packings and 2-packings of A-paths Pap, Gyula
 2005
 22 C p. 391-400
10 p.
 article
70 Paired-domination of Cartesian products of graphs and rainbow domination Brešar, Boštjan
 2005
 22 C p. 233-237
5 p.
 article
71 P-antiregular graphs Boaventura-Netto, Paulo Oswaldo
 2005
 22 C p. 41-48
8 p.
 article
72 Parameters of connectivity in ( a , b )-linear graphs Oliveira, Carla Silva
 2005
 22 C p. 189-193
5 p.
 article
73 Perfect codes in Cartesian products of hypercube and multidimensional grid Dorbec, Paul
 2005
 22 C p. 327-331
5 p.
 article
74 Perfect codes in direct products of cycles Špacapan, Simon
 2005
 22 C p. 201-205
5 p.
 article
75 Perfect Matchings of the Small Polyominoes Dong, Bin
 2005
 22 C p. 69-72
4 p.
 article
76 Priority-Consistent Graphs Farley, Arthur M.
 2005
 22 C p. 521-526
6 p.
 article
77 Quasi-amply-regularity and Generalized Hamming Graphs Affif Chaouche, F.
 2005
 22 C p. 113-117
5 p.
 article
78 Radio k-Labelings for Cartesian Products of Graphs Kchikech, Mustapha
 2005
 22 C p. 347-352
6 p.
 article
79 Rank-width and Well-quasi-ordering of Skew-symmetric Matrices Oum, Sang-il
 2005
 22 C p. 281-285
5 p.
 article
80 Read-Once Functions Revisited and the Readability Number of a Boolean Function Golumbic, Martin Charles
 2005
 22 C p. 357-361
5 p.
 article
81 Recent Results on Disjoint Cycles in Graphs Fujita, Shinya
 2005
 22 C p. 409-412
4 p.
 article
82 2-1 routing requests in the hypercube Baudon, Olivier
 2005
 22 C p. 535-538
4 p.
 article
83 Simple vertex ordering characterizations for graph search Corneil, Derek G.
 2005
 22 C p. 445-449
5 p.
 article
84 Some Algorithms on Conditionally Critical Indecomposable Graphs Dubey, Chandan K.
 2005
 22 C p. 315-319
5 p.
 article
85 Some families of arbitrarily vertex decomposable graphs Kalinowski, Rafał
 2005
 22 C p. 451-454
4 p.
 article
86 Some results on the Wiener index of iterated line graphs Dobrynin, Andrey A.
 2005
 22 C p. 469-475
7 p.
 article
87 Sum coloring of distance and circulant graphs Effantin, Brice
 2005
 22 C p. 239-244
6 p.
 article
88 Symmetry and connectivity in G-graphs Bretto, Alain
 2005
 22 C p. 481-486
6 p.
 article
89 The bi-join decomposition de Montgolfier, Fabien
 2005
 22 C p. 173-177
5 p.
 article
90 The Cyclic Antibandwidth Problem Sýkora, Ondrej
 2005
 22 C p. 223-227
5 p.
 article
91 The Grad of a Graph and Classes with Bounded Expansion Nešetřil, Jaroslav
 2005
 22 C p. 101-106
6 p.
 article
92 The maximal restricted edge connectivity of Kautz undirected graphs Wang, Shiying
 2005
 22 C p. 49-53
5 p.
 article
93 The Positive Lightness of Digraphs, Embeddable in a Surface, without 4-Cycles Andres, Stephan Dominique
 2005
 22 C p. 119-122
4 p.
 article
94 The P 4-sparse Graph Sandwich Problem Dantas, S.
 2005
 22 C p. 185-188
4 p.
 article
95 The Pure Prime Circle Orbit Conjecture Genest, François
 2005
 22 C p. 163-166
4 p.
 article
96 The Reduced Prüfer Code for Rooted Labelled k-Trees Costa Pereira, P.R.
 2005
 22 C p. 135-139
5 p.
 article
97 The total chromatic number of some bipartite graphs Campos, C.N.
 2005
 22 C p. 557-561
5 p.
 article
98 Transitive convex subsets in large tournaments Jouve, Bertrand
 2005
 22 C p. 433-437
5 p.
 article
99 Unicycle graphs and uniquely restricted maximum matchings Levit, Vadim E.
 2005
 22 C p. 261-265
5 p.
 article
100 Unions of perfect matchings in cubic graphs Kaiser, Tomáš
 2005
 22 C p. 341-345
5 p.
 article
                             100 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands