Volume 15, Issue 4 | Graphs and Combinatorics

Search all Graphs and Combinatorics articles

Volume 15, Issue 4

December 1999

Filter by

Volume:

Sort by

Date published:

New to old Old to new

10 articles in this issue

Cycles Through 23 Vertices in 3-Connected Cubic Planar Graphs
R. E. L. Aldred
S. Bau
Brendan D. McKay
Pages: 373 - 376
Bipartite Distance-regular Graphs, Part II
Brian Curtin
Pages: 377 - 391
Hamiltonicity of Amalgams
Arthur M. Farley
Andrzej Proskurowski
Maciej M. Sysło
Pages: 393 - 404
On the Spectrum of Steiner (v,k,t) Trades (II)
Brenton D. Gray
Colin Ramsay
Pages: 405 - 415
Distance-regular Graphs of the Height h
Akira Hiraki
Pages: 417 - 428
Contractible Non-Edges in Triangle-Free Graphs
Matthias Kriesell
Pages: 429 - 439
On Maximum-sized k-Regular Matroids
Charles Semple
Pages: 441 - 462
(3,k)-Factor-Critical Graphs and Toughness
Minýong Shi
Xudong Yuan
Odile Favaron
Pages: 463 - 471
Non-Bicritical Critical Snarks
Eckhard Steffen
Pages: 473 - 480
How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity?
Anders Yeo
Pages: 481 - 493