Journal of Graph Theory

Cover image for Journal of Graph Theory

Spring 1988

Volume 12, Issue 1

Pages fmi–fmi, 1–151

  1. Masthead

    1. Top of page
    2. Masthead
    3. Articles
    1. Masthead (page fmi)

      Version of Record online: 5 OCT 2006 | DOI: 10.1002/jgt.3190120101

  2. Articles

    1. Top of page
    2. Masthead
    3. Articles
    1. On k-leaf connectivity of a random graph (pages 1–10)

      Thomasz Luczak

      Version of Record online: 5 OCT 2006 | DOI: 10.1002/jgt.3190120102

    2. Contractions and hamiltonian line graphs (pages 11–15)

      Hong-Jian Lai

      Version of Record online: 5 OCT 2006 | DOI: 10.1002/jgt.3190120103

    3. Graphs with unavoidable subgraphs with large degrees (pages 17–27)

      L. Caccetta, P. Erdös and K. Vijayan

      Version of Record online: 5 OCT 2006 | DOI: 10.1002/jgt.3190120104

    4. Searching for an edge in a graph (pages 45–57)

      M. Aigner and E. Triesch

      Version of Record online: 5 OCT 2006 | DOI: 10.1002/jgt.3190120106

    5. Search algorithm for Ramsey graphs by union of group orbits (pages 59–72)

      Stanisław P. Radziszowski and Donald L. Kreher

      Version of Record online: 5 OCT 2006 | DOI: 10.1002/jgt.3190120107

    6. Homomorphisms of graphs into odd cycles (pages 73–83)

      A. M. H. Gerards

      Version of Record online: 5 OCT 2006 | DOI: 10.1002/jgt.3190120108

    7. A lower bound on the number of spanning trees with k end-vertices (pages 95–100)

      Katherine Heinrich and Guizhen Liu

      Version of Record online: 5 OCT 2006 | DOI: 10.1002/jgt.3190120110

    8. Cutting a graph into two dissimilar halves (pages 121–131)

      Paul Erdós, Mark Goldberg, János Pach and Joel Spencer

      Version of Record online: 5 OCT 2006 | DOI: 10.1002/jgt.3190120113

    9. An historical note: Euler's Königsberg letters (pages 133–139)

      Horst Sachs, Michael Stiebitz and Robin J. Wilson

      Version of Record online: 5 OCT 2006 | DOI: 10.1002/jgt.3190120114

    10. A sufficient condition for a bipartite graph to have a k-factor (pages 141–151)

      Hikoe Enomoto, Katsuhiro Ota and Mikio Kano

      Version of Record online: 5 OCT 2006 | DOI: 10.1002/jgt.3190120115

SEARCH

SEARCH BY CITATION