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
Filter by
Volume:
All volumes
Volume 40 (2024)
Volume 39 (2023)
Volume 38 (2022)
Volume 37 (2021)
Volume 36 (2020)
Volume 35 (2019)
Volume 34 (2018)
Volume 33 (2017)
Volume 32 (2016)
Volume 31 (2015)
Volume 30 (2014)
Volume 29 (2013)
Volume 28 (2012)
Volume 27 (2011)
Volume 26 (2010)
Volume 25 (2009)
Volume 24 (2008)
Volume 23 (2007)
Volume 22 (2006)
Volume 21 (2005)
Volume 20 (2004)
Volume 19 (2003)
Volume 18 (2002)
Volume 17 (2001)
Volume 16 (2000)
Volume 15 (1999)
Volume 14 (1998)
Volume 13 (1997)
Volume 12 (1996)
Volume 11 (1995)
Volume 10 (1994)
Volume 9 (1993)
Volume 8 (1992)
Volume 7 (1991)
Volume 6 (1990)
Volume 5 (1989)
Volume 4 (1988)
Volume 3 (1987)
Volume 2 (1986)
Volume 1 (1985)
Sort by
Date published:
New to old
Old to new
Update results
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