Graph Theory and combinatorics 1988, Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös - Annals of Discrete Mathematics
Latest Publications

TOTAL DOCUMENTS

38

(FIVE YEARS 0)

H-INDEX

1

(FIVE YEARS 0)

Published By Elsevier

9780444873293

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Extensions of Networks with Given Diameter

Graph Theory and combinatorics 1988, Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös - Annals of Discrete Mathematics ◽

10.1016/s0167-5060(08)70563-6 ◽

1989 ◽

pp. 31-40

Author(s):

J BERMOND ◽

K BERRADA ◽

J BOND

Download Full-text

General Editor:

Graph Theory and combinatorics 1988, Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös - Annals of Discrete Mathematics ◽

10.1016/s0167-5060(08)70555-7 ◽

1989 ◽

pp. ii-ii

Keyword(s):

Download Full-text

Scaffold Permutations

Graph Theory and combinatorics 1988, Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös - Annals of Discrete Mathematics ◽

10.1016/s0167-5060(08)70586-7 ◽

1989 ◽

pp. 335-342

Author(s):

P ROSENSTIEHL

Download Full-text

Simplicial Decompositions of Graphs: a Survey of Applications

Graph Theory and combinatorics 1988, Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös - Annals of Discrete Mathematics ◽

10.1016/s0167-5060(08)70572-7 ◽

1989 ◽

pp. 121-144

Author(s):

R DIESTEL

Download Full-text

Copyright page

Graph Theory and combinatorics 1988, Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös - Annals of Discrete Mathematics ◽

10.1016/s0167-5060(08)70557-0 ◽

1989 ◽

pp. iv-iv

Download Full-text

Trigraphs

Graph Theory and combinatorics 1988, Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös - Annals of Discrete Mathematics ◽

10.1016/s0167-5060(08)70567-3 ◽

1989 ◽

pp. 69-79

Author(s):

J BONDY

Download Full-text

Graphs with Small Bandwidth and Cutwidth

Graph Theory and combinatorics 1988, Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös - Annals of Discrete Mathematics ◽

10.1016/s0167-5060(08)70571-5 ◽

1989 ◽

pp. 113-119 ◽

Author(s):

F CHUNG ◽

P SEYMOUR

Keyword(s):

Small Bandwidth

Download Full-text

A Density Version of the Hales-Jewett Theorem for K = 3

Graph Theory and combinatorics 1988, Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös - Annals of Discrete Mathematics ◽

10.1016/s0167-5060(08)70577-6 ◽

1989 ◽

pp. 227-241 ◽

Author(s):

H FURSTENBERG ◽

Y KATZNELSON

Download Full-text

1-Factorizing Regular Graphs of High Degree-an Improved Bound

Graph Theory and combinatorics 1988, Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös - Annals of Discrete Mathematics ◽

10.1016/s0167-5060(08)70570-3 ◽

1989 ◽

pp. 103-112

Author(s):

A CHETWYND ◽

A HILTON

Keyword(s):

Regular Graphs ◽

Download Full-text

Bounds on the Measurable Chromatic Number of Rn“Sight may distinguish of colours; but suddenly To nominate them all, 's impossible.” -W. Shakespeare, King Henry VZ, Part ZZ.

Graph Theory and combinatorics 1988, Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erdös - Annals of Discrete Mathematics ◽

10.1016/s0167-5060(08)70587-9 ◽

1989 ◽

pp. 343-372

Author(s):

L SZEKELY ◽

N WORMALD

Keyword(s):

Chromatic Number ◽

Measurable Chromatic Number

Download Full-text