Skip to main content
SpringerLink
Log in

Incidence patterns of graphs and complexes

  • Conference paper
  • First Online:
The Many Facets of Graph Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 110))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Aigner On the tetrahedral graph. (to appear)

    Google Scholar 

  2. A characterization problem in graph theory. (to appear.)

    Google Scholar 

  3. A characterization of a class of regular graphs. Abstract 655–53. Notices Amer. Math. Soc. 15 (1968), 481.

    Google Scholar 

  4. A. Andreatta On finite graphs which are line-graphs. (Italian). Ist. Lombardo Accad. Sci. Lett. Rend. A. 98 (1964), 133–156.

    MathSciNet  Google Scholar 

  5. E. Asplund and B. Grünbaum On a coloring problem. Math. Scand. 8 (1960), 181–188.

    MathSciNet  MATH  Google Scholar 

  6. D.W. Barnette and B. Grünbaum On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs. (to appear)

    Google Scholar 

  7. M. Behzad Graphs and their chromatic numbers. Ph.D. Thesis, Michigan State University (1965).

    Google Scholar 

  8. A criterion for the planarity of the total graph of a graph. Proc. Camb. Phil. Soc. 63 (1967), 679–681.

    Article  MathSciNet  MATH  Google Scholar 

  9. M. Behzad and G. Chartrand Total graphs and traversability. Proc. Edinburgh Math. Soc. 15 (1966), 117–120.

    Article  MathSciNet  MATH  Google Scholar 

  10. An introduction to total graphs, Théorie des Graphes, Rome 1966, 31–33.

    Google Scholar 

  11. M. Behzad, G. Chartrand and J.K. Cooper, Jr. The colour numbers of complete graphs. J. London Math. Soc. 42 (1967), 226–228.

    Article  MathSciNet  MATH  Google Scholar 

  12. M. Behzad, G. Chartrand and E.A. Nordhaus Triangles in line-graphs and total graphs. Indian J. Math. (to appear)

    Google Scholar 

  13. L.W. Beineke A characterization of derived graphs. (to appear)

    Google Scholar 

  14. On derived graphs and digraphs. Beiträge zur Graphentheorie. (Edited by H. Sachs, H.-J. Voss, and H. Walther) Teubner, Leipzig 1968. pp. 17–23.

    Google Scholar 

  15. S. Benzer On the topology of the genetic fine structure. Proc. Nat. Acad. Sci. U.S.A. 45 (1959), 1607–1620.

    Article  Google Scholar 

  16. The fine structure of the gene. Scientific American 206 (1962), No. 1, 70–84.

    Google Scholar 

  17. C. Berge Färbungen von Graphen, deren sämtliche bzw. deren ungerade Kreise starr sind. Wiss. Zeitschr. Martin Luther Univ. Halle-Wittenberg, 10 (1961), 114–115.

    Google Scholar 

  18. R.C. Bose Strongly regular graphs, partial geometries and partially balanced designs. Pacif. J. Math. 13 (1963), 389–419.

    Article  MathSciNet  MATH  Google Scholar 

  19. R.C. Bose and R. Laskar A characterization of tetrahedral graphs. J. Combinatorial Theory 3 (1967), 366–385.

    Article  MathSciNet  MATH  Google Scholar 

  20. J.P. Burling On coloring problems of families of prototypes. Ph.D. Thesis, University of Colorado (1965).

    Google Scholar 

  21. R.G. Busacker and T.L. Saaty Finite graphs and networks. McGraw-Hill, New York, 1965.

    MATH  Google Scholar 

  22. L.-C. Chang The uniqueness and non-uniqueness of the triangular association schemes. Science Record, Math. N.S. 3 (1959), 604–613.

    MATH  Google Scholar 

  23. Association schemes of partially balanced designs with parameters v = 28, n1 = 12, n2 = 15 and p 211 = 4. Science Record, Math., N.S. 4 (1960), 12–18.

    Google Scholar 

  24. G. Chartrand Graphs and their associated line-graphs. Ph.D. Thesis, Michigan State University (1964).

    Google Scholar 

  25. The existence of complete cycles in repeated line-graphs. Bull. Amer. Math. Soc. 71 (1965), 668–670.

    Article  MathSciNet  MATH  Google Scholar 

  26. On hamiltonian line-graphs. Trans. Amer. Math. Soc. 134 (1968), 559–566.

    Article  MathSciNet  MATH  Google Scholar 

  27. G. Chartrand and M.J. Stewart Total digraphs. Canad. Math. Bull. 9 (1966), 171–176.

    Article  MathSciNet  MATH  Google Scholar 

  28. The connectivity of line-graphs. (to appear)

    Google Scholar 

  29. W.S. Connor The uniqueness of the triangular association scheme. Ann. Math. Stat. 29 (1958), 262–266.

    Article  MathSciNet  MATH  Google Scholar 

  30. L. Danzer, B. Grünbaum and V. Klee Helly's theorem and its relatives. Proc. Symp. Pure Math. vol. 7 (Convexity), pp. 101–180 (1963).

    Article  MATH  Google Scholar 

  31. B. Das Tactical configurations and graph theory. Calcutta Statist. Assoc. Bull. 16 (1967), 136–138.

    Article  MathSciNet  MATH  Google Scholar 

  32. T.A. Dowling A characterization of the graph of the Tm association scheme. Notices Amer. Math. Soc. 14 (1967), 843.

    Google Scholar 

  33. P. Erdös, A. Goodman and L. Pósa The representation of a graph by set intersections. Canad. J. Math., 18 (1966), 106–112.

    Article  MathSciNet  MATH  Google Scholar 

  34. D.R. Fulkerson and O.A. Gross Incidence matrices with the consecutive ones property. Bull. Amer. Math. Soc. 70 (1964), 681–684.

    Article  MathSciNet  MATH  Google Scholar 

  35. Incidence matrices and interval graphs. Pacif. J. Math. 15 (1965), 835–855.

    Article  MathSciNet  MATH  Google Scholar 

  36. D. Geller and F. Harary Arrow diagrams are line digraphs. J. SIAM Appl. Math. 16 (1968), 1141–1145.

    Article  MathSciNet  MATH  Google Scholar 

  37. A. Ghirlanda Osservazioni sulle caratteristiche dei grafi o singrammi. Ann. Univ. Ferrara Sez. VII (N.S.) 11 (1962/65), 93–106.

    MathSciNet  MATH  Google Scholar 

  38. P.C. Gilmore and A.J. Hoffman A characterization of comparability graphs and of interval graphs. Canad. J. Math. 16 (1964), 539–548.

    Article  MathSciNet  MATH  Google Scholar 

  39. B. Grünbaum Borsuk's problem and related questions. Proc. Symp. Pure Math. vol. 7 (Convexity), pp. 271–284 (1963).

    Article  MATH  Google Scholar 

  40. Convex polytopes. Wiley, New York, 1967.

    MATH  Google Scholar 

  41. Nerves of simplicial complexes. Aequationes Math. (to appear)

    Google Scholar 

  42. Polytopes, graphs, and complexes. Bull. Amer. Math. Soc. (to appear).

    Google Scholar 

  43. R.P. Gupta The cover index of a graph. (to appear)

    Google Scholar 

  44. G. Hajós On a type of graph. Inter. Math. News. Sondernummer (1957), 65.

    Google Scholar 

  45. R.C. Hamelink A partial characterization of clique graphs. J. Combinatorial Theory 5 (1968), 192–197.

    Article  MathSciNet  MATH  Google Scholar 

  46. F. Harary An elementary theorem on graphs. Amer. Math. Monthly 66 (1959), 405–407.

    Article  MathSciNet  MATH  Google Scholar 

  47. A characterization of block-graphs. Canad. Math. Bull. 6 (1963), 1–6.

    Article  MathSciNet  MATH  Google Scholar 

  48. Graph Theory. Addison-Wesley, Reading (to appear).

    Google Scholar 

  49. F. Harary and C. Nash-Williams On eulerian and hamiltonian graphs and line graphs. Canad. Math. Bull. 8 (1965), 701–709.

    Article  MathSciNet  MATH  Google Scholar 

  50. F. Harary and R. Norman Some properties of line digraphs. Rend. Circ. Mat. Palermo 9 (1961), 161–168.

    Article  MathSciNet  MATH  Google Scholar 

  51. C. Heuchenne Sur une certaine correspondence entre graphes. Bull. Soc. Roy. Sci. Liege 33 (1964), 743–753.

    MathSciNet  MATH  Google Scholar 

  52. A.J. Hoffman On the exceptional case in a characterization of the arcs of a complete graph. IBM Journal 4 (1960), 487–496.

    Article  MathSciNet  MATH  Google Scholar 

  53. On the uniqueness of the triangular association scheme. Ann. Math. Stat. 31 (1960), 492–497.

    Article  MathSciNet  MATH  Google Scholar 

  54. On the line-graph of the complete bipartite graph. Ann. Math. Stat. 35 (1964), 883–885.

    Article  MathSciNet  MATH  Google Scholar 

  55. On the line-graph of a projective plane. Proc. Amer. Math. Soc. 16 (1965), 297–302.

    Article  MathSciNet  MATH  Google Scholar 

  56. A.J. Hoffman and D. Ray-Chaudhuri On the line-graph of a finite affine plane. Canad. J. Math. 17 (1965), 687–694.

    Article  MathSciNet  MATH  Google Scholar 

  57. On the line-graph of a symmetric balanced incomplete block design. Trans. Amer. Math. Soc. 116 (1965), 238–252.

    Article  MathSciNet  MATH  Google Scholar 

  58. P. Kasteleyn A soluble self avoiding walk problem. Physica 29 (1963), 1329–1337.

    Article  MathSciNet  Google Scholar 

  59. A. Kotzig On the theory of finite regular graphs of degree three and four. (Slovak) Časop. Pěst. Mat. 82 (1957), 76–92.

    MathSciNet  Google Scholar 

  60. A. Kotzig Paare Hajóssche Graphen. Časop. Pěst. Mat. 88 (1963), 236–241.

    MathSciNet  MATH  Google Scholar 

  61. J. Krausz Démonstration nouvelle d'un théorème de Whitney sur les réseaux. (Hungarian; French summary) Mat. Fiz. Lapok 50 (1943), 75–85.

    MathSciNet  MATH  Google Scholar 

  62. R. Laskar A characterization of cubic lattice graphs. J. Combinatorial Theory 3 (1967), 386–401.

    Article  MathSciNet  MATH  Google Scholar 

  63. C.G. Lekkerkerker and J.C. Boland Representation of a finite graph by a set of intervals on the real line. Fund. Math. 51 (1962), 45–64.

    MathSciNet  MATH  Google Scholar 

  64. Z.A. Melzak On a class of configuration and coincidence problems. Bell System Techn. J. 47 (1968), 1105–1129.

    Article  MATH  Google Scholar 

  65. V. Menon The isomorphism between graphs and their adjoint graphs. Canad. Math. Bull. 8 (1965), 7–15.

    Article  MathSciNet  MATH  Google Scholar 

  66. On repeated interchange graphs. Amer. Math. Monthly 73 (1966), 986–989.

    Article  MathSciNet  MATH  Google Scholar 

  67. J.W. Moon On the line-graph of the complete bigraph. Ann. Math. Stat. 34 (1963), 664–667.

    Article  MathSciNet  MATH  Google Scholar 

  68. L. Muracchini and A.M. Ghirlanda Sul grafo commutato e sul grafo apposto di un grafo orientato. Atti Sem. Mat. Fis. Univ. Modena, 14 (1865), 87–97.

    MathSciNet  MATH  Google Scholar 

  69. O. Ore Theory of Graphs. Amer. Math. Soc. Colloq. Publ. vol. 38. Providence 1962.

    Google Scholar 

  70. The four-color problem. Academic Press, New York 1967.

    MATH  Google Scholar 

  71. D.K. Ray-Chaudhuri Characterization of line-graphs. J. Combinatorial Theory 3 (1967), 201–214.

    Article  MathSciNet  MATH  Google Scholar 

  72. F.S. Roberts Representations of indifference relations. Ph.D. Thesis, Stanford University 1968.

    Google Scholar 

  73. On the boxicity and cubicity of a graph. (to appear)

    Google Scholar 

  74. A.C.M. van Rooij and H.S. Wilf The interchange graph of a finite graph. Acta Math. Acad. Sci. Hungar. 16 (1965), 263–269.

    Article  MathSciNet  MATH  Google Scholar 

  75. M. Rosenfeld On the total chromatic number of certain graphs. (to appear)

    Google Scholar 

  76. G. Sabidussi Graph derivatives. Math. Z. 76 (1961), 385–401.

    Article  MathSciNet  MATH  Google Scholar 

  77. J. Sedlaček Some properties of interchange graphs. Theory of graphs and its applications. Smolenice 1963 (Prague 1964), 145–150.

    Google Scholar 

  78. S. Seshu and M. Reed Linear graphs and electrical networks. Addison-Wesley, Reading 1961.

    Google Scholar 

  79. S.S. Shrikhande On a characterization of the triangular association scheme. Ann. Math. Stat. 30 (1959), 39–47.

    Article  MathSciNet  MATH  Google Scholar 

  80. The uniqueness of the L2 association scheme. Ann. Math. Stat. 30 (1959), 781–798.

    Article  MathSciNet  MATH  Google Scholar 

  81. E. Steinitz Polyeder und Raumeinteilungen. Enzyk. Math. Wiss. 3AB12, pp. 1–139 (1922).

    Google Scholar 

  82. E. Steinitz and H. Rademacher Vorlesungen über die Theoie der Polyeder. Springer, Berlin 1934.

    MATH  Google Scholar 

  83. G. Wegner Eigenschaften der Nerven homologisch-einfacher Familien. Ph.D. Thesis, University of Göttingen (1967).

    Google Scholar 

  84. H. Whitney Congruent graphs and the connectivity of graphs. Amer. J. Math. 54 (1932), 150–168.

    Article  MathSciNet  MATH  Google Scholar 

  85. A.A. Zykov Problem 12. Beiträge zur Graphentheorie. (Edited by H. Sachs, H.-J. Voss and H. Walther.) Teubner, Leipzig 1968. page 228.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Washington, USA

    Branko Grünbaum

Authors
  1. Branko Grünbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Chartrand S. F. Kapoor

Rights and permissions

Reprints and permissions

Copyright information

© 1969 Springer-Verlag

About this paper

Cite this paper

Grünbaum, B. (1969). Incidence patterns of graphs and complexes. In: Chartrand, G., Kapoor, S.F. (eds) The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060111

Download citation

  • DOI: https://doi.org/10.1007/BFb0060111

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-04629-5

  • Online ISBN: 978-3-540-36161-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation