default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraphs and Combinatorics, Volume 1
Volume 1, Number 1, December 1985
- Hoon heng Teh:
Foreword. 1-2 - Claude Berge, Paul Erdös, Sin Hitotumatu, Loo Keng Hua, Richard Rado:
Notes of welcome. 3-6 - Robert E. L. Aldred, Derek A. Holton, Carsten Thomassen:
Cycles through four edges in 3-connected cubic graphs. 7-11 - Noga Alon, Peter Frankl:
The maximum number of disjoint pairs in a family of subsets. 13-21 - László Babai
:
An anti-Ramsey theorem. 23-28 - Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz:
Randomlyn-cyclic digraphs. 29-40 - Fan R. K. Chung, Ronald L. Graham, Peter M. Winkler:
On the addressing problem for directed graphs. 41-50 - Zoltán Füredi:
A Ramsey-Sperner theorem. 51-56 - Noboru Ito:
Hadamard graphs. I. 57-64 - Gil Kalai:
Hyperconnectivity of graphs. 65-79 - Wolfgang Mader:
Paths in graphs, reducing the edge-connectivity only by two. 81-89 - Vojtech Rödl, Richard A. Duke:
On graphs with small subgraphs of large chromatic number. 91-96 - Sharad S. Sane, S. S. Shrikhande, N. M. Singhi:
Maximal arcs in designs. 97-106 - Gil Kalai:
A new approach to Turán's conjecture. 107-109 - Atsushi Amahashi:
On factors with all degrees odd. 111-114 - Béla Bollobás, Andrew J. Harris:
List-colourings of graphs. 115-127 - Peter J. Cameron:
Cyclic automorphisms of a countable graph and random sum-free sets. 129-135 - Gary Chartrand, Frank Harary, Ortrud R. Oellermann:
On the regulation number of a multigraph. 137-144 - Jerrold R. Griggs, Andrew R. Kustin, Jeffrey A. Ross, Jürgen Stahl:
The lexicographic sum of Cohen-Macaulay and shellable ordered sets. 145-163 - William M. Kantor:
Classification of 2-transitive symmetric designs. 165-166 - Michael Mörs:
A generalization of a theorem of Kruskal. 167-183 - Kazue Sawade:
A Hadamard matrix of order 268. 185-187 - Douglas R. Stinson:
The spectrum of nested Steiner triple systems. 189-191 - Nicholas C. Wormald:
Counting labelled chordal graphs. 193-200 - Feng Tian, Xiaotie Deng, Ronghua Shi:
Smallest regular graphs with girth pair (4, 2t+1). 201-202 - Wang Yuan:
Orbituary. 205-206 - Thomas Bier:
Hyperplane codes. 207-212 - Peter Frankl, Vojtech Rödl:
Lower bounds for Turán's problem. 213-216 - Adriano M. Garsia, Jeffrey B. Remmel:
Shuffles of permutations and the Kronecker product. 217-263 - Khee Meng Koh, K. S. Poh:
On a construction of critical graphs which are not sensitive. 265-270 - Hiroshi Maehara:
Contact patterns of equal nonoverlapping spheres. 271-282 - Christina M. Mynhardt:
Degree sets of degree uniform graphs. 283-290 - Vojtech Rödl:
Note on a Ramsey-Turán type problem. 291-293 - Mao Lin Zheng, Rong-si Chen:
A maximal cover of hexagonal systems. 295-298 - Carsten Thomassen:
Subgraphs with large degrees and girth. 299-300 - Lee Peng Yee:
Prof. Hua Loo-Keng (1910-1985) - Mathematician, teacher, and practitioner. 301 - Ron Aharoni:
Matchings inn-partiten-graphs. 303-304 - Noga Alon:
Asynchronous threshold networks. 305-310 - Nora Hartsfield, Brad Jackson, Gerhard Ringel:
The splitting number of the complete graph. 311-329 - Noboru Ito:
Hadamard graphs. II. 331-337 - Peter Nevermann, Ivan Rival:
Holes in ordered sets. 339-350 - Akira Saito, Songlin Tian:
The binding number of line graphs and total graphs. 351-356 - Joel Spencer:
Probabilistic methods. 357-382 - Fuji Zhang, Rong-si Chen, Xiao-fong Gzo:
Perfect matchings in hexagonal systems. 383-386 - Noga Alon:
Hypergraphs with high chromatic number. 387-389
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 2024-11-08 20:37 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:
