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
 
                             71 results found
no title author magazine year volume issue page(s) type
1 A C.A.S. treatment of optimal-diameter double-loop digraphs families 1 1 Work partially supported by the Comisión Interministerial de Ciencia y Tecnología, CICYT, under project TIC-97-0963 and by the Catalan Research Council under project 1998SGR-0119. Aguiló-Gost, F.
 2002
 11 C p. 1-11
11 p.
 article
2 A Characteristic Approach to Bipartite Graphs and Incidence Graphs McKee, Terry A.
 2002
 11 C p. 478-484
7 p.
 article
3 Addressing the Petersen graph Elzinga, Randall J.
 2002
 11 C p. 278-283
6 p.
 article
4 All Lobsters with Perfect Matchings are Graceful Morgan, David
 2002
 11 C p. 503-508
6 p.
 article
5 A note on construction of upper bound graphs Era, Hiroshi
 2002
 11 C p. 284-291
8 p.
 article
6 A Sharp Bound for the Marginal Appendage Number Johns, Garry L.
 2002
 11 C p. 410-416
7 p.
 article
7 Basic Structures of Some Interconnection Networks Cheng, Eddie
 2002
 11 C p. 140-156
17 p.
 article
8 Bounds on the signed domination number of a graph Haas, Ruth
 2002
 11 C p. 742-750
9 p.
 article
9 Chromatic Numbers and Cycle Parities of Quadrangulations on Nonorientable Closed Surfaces Nakamoto, Atsuhiro
 2002
 11 C p. 509-518
10 p.
 article
10 Chromatic numbers of the strong product of odd cycles Z̆erovnik, Janez
 2002
 11 C p. 647-652
6 p.
 article
11 Coloring the Vertices of a Graph With Measurable Sets in a Probability Space Johnson Jr., P.D.
 2002
 11 C p. 417-424
8 p.
 article
12 Congruent Dudeney Dissections of Polygons I Akiyama, Jin
 2002
 11 C p. 12-19
8 p.
 article
13 Constructing Cospectral Digraphs with Arbitrary Centers Walters, Ian
 2002
 11 C p. 620-625
6 p.
 article
14 Contractible edges in minimally k-connected graphs Ando, Kiyoshi
 2002
 11 C p. 20-29
10 p.
 article
15 Counting Lattice Paths with an Infinite Step Set and Special Access Humphreys, Katherine
 2002
 11 C p. 365-375
11 p.
 article
16 Directed Covering with Block Size 5 and Index Odd Assaf, Ahmed M.
 2002
 11 C p. 30-52
23 p.
 article
17 Disconnected Complements of Steinhaus graphs Dymàček, Wayne M.
 2002
 11 C p. 218-232
15 p.
 article
18 Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees 1 1 Written August, 2000. Revised July, 2001. Jiang, Tao
 2002
 11 C p. 376-385
10 p.
 article
19 Edge-magic Indices of (n, n – 1)-graphs 1 1 Partially supported by Faculty Research Grant of Hong Kong Baptist University. Shiu, Wai Chee
 2002
 11 C p. 443-458
16 p.
 article
20 Efficient Open Domination Gavlas, Heather
 2002
 11 C p. 681-691
11 p.
 article
21 Embedded antichains in tournaments Greenfield, Stephen J.
 2002
 11 C p. 349-357
9 p.
 article
22 Evenly partite star-factorization of symmetric complete tripartite multi-digraphs Ushio, Kazuhiko
 2002
 11 C p. 608-611
4 p.
 article
23 Excluded–Minor Characterizations of Antimatroids arisen from Posets and Graph Searches Nakamura, M.
 2002
 11 C p. 525-541
17 p.
 article
24 Graph Operations and Zipfian Degree Distributions Kirchherr, Walter
 2002
 11 C p. 438-442
5 p.
 article
25 Graphs Having (2 mod d)-Cycles Shauger, Stephen E.
 2002
 11 C p. 580-594
15 p.
 article
26 Independent Production of Non Hamiltonian Graphs Jurkiewicz, Samuel
 2002
 11 C p. 315-321
7 p.
 article
27 Influence Digraphs Induced by Time-Stamped Graphs (Extended Abstract) Cheng, Eddie
 2002
 11 C p. 128-139
12 p.
 article
28 Kings Domination on a Torus Watkins, John J.
 2002
 11 C p. 626-631
6 p.
 article
29 Lacunary Polynomial Sums Ericksen, Larry
 2002
 11 C p. 292-298
7 p.
 article
30 Light Paths in Large Polyhedral Maps with Prescribed Minimum Degree Jendrol, S.
 2002
 11 C p. 386-409
24 p.
 article
31 Long Paths Through Specified Vertices In 3-Connected Graphs Sakai, Toshinori
 2002
 11 C p. 550-561
12 p.
 article
32 Maximum Arc-integrity of Tournaments and Bipartite Tournaments Vandell, Robert C.
 2002
 11 C p. 612-619
8 p.
 article
33 Maximum Face-Constrained Coloring of Plane Graphs 1 1 Written August, 2000. Revised July, 2001. Ramamurthi, Radhika
 2002
 11 C p. 542-549
8 p.
 article
34 Modelling 3-configurations on Surfaces White, Arthur T.
 2002
 11 C p. 632-646
15 p.
 article
35 More Progress on Tough Graphs - The Y2K Report Bauer, Doug
 2002
 11 C p. 63-80
18 p.
 article
36 New necessary and sufficient conditions on (a i , m i ) in order that x ≡ a i (mod m i ) be a covering system Porubský, Štefan
 2002
 11 C p. 562-566
5 p.
 article
37 No Cycling in the Graphs! Beineke, Lowell W.
 2002
 11 C p. 81-88
8 p.
 article
38 Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected Graphs Egawa, Yoshimi
 2002
 11 C p. 253-264
12 p.
 article
39 On 3-coloring of plane triangulations Nakamoto, Atsuhiro
 2002
 11 C p. 519-524
6 p.
 article
40 On Integral Sum Graphs Chen, Zhibo
 2002
 11 C p. 117-127
11 p.
 article
41 On minimally 3-connected graphs on a surface Ota, Katsuhiro
 2002
 11 C p. 760-
1 p.
 article
42 On Perfect Cayley Graphs Dizon-Garciano, Agnes V.
 2002
 11 C p. 653-680
28 p.
 article
43 On robust cycle bases Kainen, Paul C.
 2002
 11 C p. 430-437
8 p.
 article
44 On the existence of uniquely partitionable graphs Mihók, Peter
 2002
 11 C p. 485-490
6 p.
 article
45 On the Genus of a Subfield of a Field Jones, Dawn M.
 2002
 11 C p. 425-429
5 p.
 article
46 On the genus of the groups PSL(2, q), PSL(3, q), and PSp(4, q) Ealy Jr, Clifton E.
 2002
 11 C p. 233-252
20 p.
 article
47 On the Hamiltonian cycle Decompositions of Complete 3-Uniform Hypergraphs Xu, Baoguang
 2002
 11 C p. 722-733
12 p.
 article
48 On the Rationale of the Transformity Method Collins, Dennis
 2002
 11 C p. 172-200
29 p.
 article
49 On the Super Edge-Magic Deficiency of Graphs 1 1 Dedicated to Professor Anna Lladó Figueroa-Centeno, R.M.
 2002
 11 C p. 299-314
16 p.
 article
50 Partitions of Graphs into Cographs Gimbel, John
 2002
 11 C p. 705-721
17 p.
 article
51 Path Partitions and Pn -free Sets Dunbar, Jean E.
 2002
 11 C p. 209-217
9 p.
 article
52 Preface Alavi, Yousef
 2002
 11 C p. 761-762
2 p.
 article
53 Properties of Regular Uniform k—Stratified Graphs Kokkinos, Konstantinos
 2002
 11 C p. 692-704
13 p.
 article
54 Remarks on Distance Distributions for Graphs Modeling Computer Networks Elenbogen, Bruce
 2002
 11 C p. 265-277
13 p.
 article
55 Restrictions on the weight distribution of quaternary linear codes Guritman, Sugi
 2002
 11 C p. 734-741
8 p.
 article
56 Separation of Antiweb-Wheel Inequalities Over Stable Set Polytopes Cheng, Eddie
 2002
 11 C p. 157-171
15 p.
 article
57 Spanning Forests of Digraphs and Limiting Probabilities of Markov Chains 1 1 This work was supported by RFBR Grant 99-01-01151 and INTAS Grant 96-106. Chebotarev, Pavel
 2002
 11 C p. 108-116
9 p.
 article
58 Splitting Operation and Connectedness in Binary Matroids Shikare, M.M.
 2002
 11 C p. 595-607
13 p.
 article
59 The Domination Number of Cubic Graphs with Girth at least Five Fisher, David C.
 2002
 11 C p. 751-759
9 p.
 article
60 The Fifth and Sixth Coefficients of the Characteristic Polynomial of a Graph de Moraes, Patrícia Erthal
 2002
 11 C p. 201-208
8 p.
 article
61 The Forest Metrics for Graph Vertices 1 1 This work was supported by RFBR Grant 99-01-01151 and INTAS Grant 96- 106. Chebotarev, Pavel
 2002
 11 C p. 98-107
10 p.
 article
62 The Harmonious Chromatic Number of Deep and Wide Complete n- ary Trees Mitchem, John
 2002
 11 C p. 491-502
12 p.
 article
63 The Isoperimetric Number and The Bisection Width of Generalized Cylinders Azizoğlu, M.Cemil
 2002
 11 C p. 53-62
10 p.
 article
64 The Maximum Genus of a Graph with Given Diameter and Connectivity Fu, Hung-Lin
 2002
 11 C p. 322-329
8 p.
 article
65 The Maximum Genus of a Graph with Given Diameter and Connectivity Fu, Humg-Lin
 2002
 11 C p. 330-337
8 p.
 article
66 Total chromatic number of graphs with small genus Luo, Rong
 2002
 11 C p. 468-477
10 p.
 article
67 Traceability in Small Claw-Free Graphs Harris, John M.
 2002
 11 C p. 358-364
7 p.
 article
68 Unsolved Problems on Distance in Graphs Buckley, Fred
 2002
 11 C p. 89-97
9 p.
 article
69 Vertex Coverings by Coloured Induced Graphs—Frames and Umbrellas Goddard, Wayne
 2002
 11 C p. 338-348
11 p.
 article
70 Vertex Partitions of Hypercubes into Symmetric Snakes Lukito, Agung
 2002
 11 C p. 459-467
9 p.
 article
71 Width and f-vectors of Cutsets in the Truncated Boolean Lattice Shahriari, Shahriar
 2002
 11 C p. 567-579
13 p.
 article
                             71 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands