Journal of Graph Theory

Cover image for Journal of Graph Theory

November 2000

Volume 35, Issue 3

Pages 161–226

    1. Decreasing the diameter of bounded degree graphs (pages 161–172)

      Noga Alon, András Gyárfás and Miklós Ruszinkó

      Article first published online: 16 OCT 2000 | DOI: 10.1002/1097-0118(200011)35:3<161::AID-JGT1>3.0.CO;2-Y

    2. Another note on cliques and independent sets (pages 173–175)

      Fred Galvin

      Article first published online: 16 OCT 2000 | DOI: 10.1002/1097-0118(200011)35:3<173::AID-JGT2>3.0.CO;2-O

    3. On graphs with linear Ramsey numbers (pages 176–192)

      R. L. Graham, V. Rödl and A. Ruciński

      Article first published online: 16 OCT 2000 | DOI: 10.1002/1097-0118(200011)35:3<176::AID-JGT3>3.0.CO;2-C

    4. Long cycles in critical graphs (pages 193–196)

      Noga Alon, Michael Krivelevich and Paul Seymour

      Article first published online: 16 OCT 2000 | DOI: 10.1002/1097-0118(200011)35:3<193::AID-JGT4>3.0.CO;2-G

    5. Coloring edges of embedded graphs (pages 197–205)

      Daniel P. Sanders and Yue Zhao

      Article first published online: 16 OCT 2000 | DOI: 10.1002/1097-0118(200011)35:3<197::AID-JGT5>3.0.CO;2-1

    6. Crossing properties of graph reliability functions (pages 206–221)

      Alexander K. Kelmans

      Article first published online: 16 OCT 2000 | DOI: 10.1002/1097-0118(200011)35:3<206::AID-JGT6>3.0.CO;2-7

    7. A lower bound for the crossing number of Cm × Cn (pages 222–226)

      Gelasio Salazar

      Article first published online: 16 OCT 2000 | DOI: 10.1002/1097-0118(200011)35:3<222::AID-JGT7>3.0.CO;2-E

SEARCH

SEARCH BY CITATION