
- Connectivity and Separating Sets of Cages
- Isometric Cycles, Cutsets, and Crowning
- Combinatorics, Probability and Computing (2003) 12, 495511. c 2003 Cambridge University Press DOI: 10.1017/S0963548303005868 Printed in the United Kingdom
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2008 Society for Industrial and Applied Mathematics
- STRUCTURAL AND EXTREMAL PROBLEMS IN GRAPH THEORY B.S. Zhejiang University, P.R. China, 1994
- Constrained Ramsey Numbers of Graphs
- Compact Topological Minors in Graphs
- Compact topological cliques in sparse graphs Department of Mathematics and Statistics
- Set systems without a strong simplex (revised) Oleg Pikhurko
- ARTICLE IN PRESS Theoretical Computer Science ( )
- Ramsey numbers of some bipartite graphs versus complete graphs
- Induced Turan problems: Largest Pm-free graphs with bounded degree
- Combinatorics, Probability and Computing (2003) 12, 585598. c 2003 Cambridge University Press DOI: 10.1017/S096354830300590X Printed in the United Kingdom
- Graphs and Combinatorics (2011) 27:121128 DOI 10.1007/s00373-010-0959-0
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2010 Society for Industrial and Applied Mathematics
- Discrete Mathematics 309 (2009) 42474252 Contents lists available at ScienceDirect
- Anti-Ramsey Numbers of Doubly Edge-Critical
- Bipartite Anti-Ramsey Numbers of Cycles
- Properly Colored Subgraphs and Rainbow Subgraphs in Edge-Colorings
- Vertex-Disjoint Cycles Containing Prescribed
- / 0095-8956/02 $35.00 2002 Elsevier Science (USA)
- Journal of Combinatorial Theory, Series B 83, 221 232 (2001) On a Conjecture about Trees in Graphs with Large Girth
- Small Odd Cycles in 4-Chromatic Graphs
- EDGE-BANDWIDTH OF GRAPHS TAO JIANG, DHRUV MUBAYI, ADITYA SHASTRI, AND DOUGLAS B. WEST
- IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 8, AUGUST 2004 1655 Asymptotic Improvement of the GilbertVarshamov
- COMBINATORICA Bolyai Society Springer-Verlag
- Near optimal bounds for Steiner trees in the hypercube Zevi Miller