default search action
Graphs and Combinatorics, Volume 15
Volume 15, Number 1, March 1999
- Noga Alon, Mario Szegedy:
Large Sets of Nearly Orthogonal Vectors. 1-4 - Yair Caro, Raphael Yuster:
Graph Decomposition of Slim Graphs. 5-19 - Paul Erdös, Tom Fowler:
Finding Large p-Colored Diameter Two Subgraphs. 21-27 - Andreas Huck:
Independent Trees in Planar Graphs Independent trees. 29-77 - Kazumasa Nomura:
Type II Matrices of Size Five. 79-92 - Milind A. Sohoni:
Rapid Mixing of Some Linear Matroids and Other Combinatorial Objects. 93-107 - Eric Sparla:
A New Lower Bound Theorem for Combinatorial 2k-Manifolds. 109-125
Volume 15, Number 2, June 1999
- Stanislaw Bylka
, Adam Idzik, Jan Komar:
Bipartite Subgraphs of Graphs with Maximum Degree Three. 129-136 - Mao-cheng Cai, Odile Favaron, Hao Li:
(2, k)-Factor-Critical Graphs and Toughness. 137-142 - Brian Curtin:
Bipartite Distance-regular Graphs, Part I. 143-158 - Wayne Goddard, Michael A. Henning, Hiren Maharaj
Homogeneous Embeddings of Cycles in Graphs. 159-173 - T. Aaron Gulliver, Masaaki Harada:
New Optimal Self-Dual Codes over GF(7). 175-186 - Mariko Hagita:
Foldings of Difference Sets in Abelian Groups. 187-193 - Tayuan Huang, Chao-Rong Liu:
Spectral Characterization of Some Generalized Odd Graphs. 195-209 - Andreas Huck:
Independent Trees and Branchings in Planar Multigraphs. 211-220 - Miroslav Petrovic:
Graphs with a Small Number of Nonnegative Eigenvalues. 221-232 - Ákos Seress, Tibor Szabó:
On Erdős's Eulerian Trail Game. 233-237 - Shin-ichi Tokunaga:
A Cellular Triangle Containing a Specified Point. 239-247 - H. P. Yap, Qi Zhang Liu
Edge Colouring of K2n with Spanning Star-Forests Receiving Distinct Colours. 249-255
Volume 15, Number 3, September 1999
- Ahmed Ainouche, Mekkia Kouider:
Hamiltonism and Partially Square Graphs. 257-265 - Oleg V. Borodin, Douglas R. Woodall:
Cyclic Degrees of 3-Polytopes. 267-277 - Chuanping Chen, Amel Harkat-Benhamdine, Hao Li:
Distance-Dominating Cycles in Quasi Claw-Free Graphs. 279-285 - Saad I. El-Zanati, Charles Vanden Eynden:
Factorizations of Km, n into Spanning Trees. 287-293 - Shin-Jie Hu, Justie Su-tzu Juan
T-Colorings and T-Edge Spans of Graphs. 295-301 - Stanislav Jendrol'
A Local Property of Large Polyhedral Maps on Compact 2-Dimensional Manifolds. 303-313 - Gyula Y. Katona:
Properties of Edge-Tough Graphs. 315-325 - Hye Kyung Kim, Jin-Hwan Kim, Daekeun Lim:
Natural Isomorphism Classes of Cycle Permutation Graphs Over a Graph. 327-336 - Ryuzaburo Noda:
A Bound for the Lengths of Arcs in Steiner Systems. 337-340 - Edward R. Scheinerman, Ann N. Trenk:
On the Fractional Intersection Number of a Graph. 341-351 - Hong Wang:
On Vertex-Disjoint Complete Bipartite Subgraphs in a Bipartite Graph. 353-364 - Guiying Yan:
A New Result on Alspach's Problem. 365-371
Volume 15, Number 4, December 1999
- Robert E. L. Aldred, Sheng Bau, Derek A. Holton, Brendan D. McKay
Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs. 373-376 - Brian Curtin:
Bipartite Distance-regular Graphs, Part II. 377-391 - Arthur M. Farley, Andrzej Proskurowski, Miroslawa Skowronska, Maciej M. Syslo:
Hamiltonicity of Amalgams. 393-404 - Brenton D. Gray, Colin Ramsay:
On the Spectrum of Steiner (v, k, t) Trades (II). 405-415 - Akira Hiraki:
Distance-regular Graphs of the Height h. 417-428 - Matthias Kriesell:
Contractible Non-Edges in Triangle-Free Graphs. 429-439 - Charles Semple
On Maximum-sized k-Regular Matroids. 441-462 - Minyong Shi, Xudong Yuan, Mao-cheng Cai, Odile Favaron:
(3, k)-Factor-Critical Graphs and Toughness. 463-471 - Eckhard Steffen
Non-Bicritical Critical Snarks. 473-480 - Anders Yeo:
How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity? 481-493
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-12 23:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
