Skip to main content
Log in
Menu
Find a journal
Publish with us
Track your research
Search
Cart
Home
Graphs and Combinatorics
Volumes and issues
Volume 15, Issue 1
Graphs and Combinatorics
Publishing model
:
Hybrid
Submit your manuscript
(this opens in a new tab)
Back to Overview
Editorial board
Aims and scope
Journal updates
Search all Graphs and Combinatorics articles
Volume 15, Issue 1
March 1999
7 articles in this issue
Large Sets of Nearly Orthogonal Vectors
Noga Alon
Mario Szegedy
Pages: 1 - 4
Graph Decomposition of Slim Graphs
Yair Caro
Raphael Yuster
Pages: 5 - 19
Finding Large p-Colored Diameter Two Subgraphs
Paul Erdo˝s
Tom Fowler
Pages: 21 - 27
Independent Trees in Planar Graphs Independent trees
Andreas Huck
Pages: 29 - 77
Type II Matrices of Size Five
Kazumasa Nomura
Pages: 79 - 92
Rapid Mixing of Some Linear Matroids and Other Combinatorial Objects
Milind Sohoni
Pages: 93 - 107
A New Lower Bound Theorem for Combinatorial 2k-Manifolds
Eric Sparla
Pages: 109 - 125
Search
Search by keyword or author
Search
Navigation
Find a journal
Publish with us
Track your research