Skip to main content

Graphs of (0,1)-matrices

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

Keywords

  • Bipartite Graph
  • Chromatic Number
  • Line Graph
  • Comparability Graph
  • Point Versus

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aigner, M. The uniqueness of the cubic lattice graph. J. Combinatorial Theory 6, 282–297 (1969).

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Beineke, L. Derived graphs and digraphs, Beiträge zur Graphentheorie (H. Sachs, H. Voss, and H. Walther, eds.). Teukner, Leipzig, 17–33 (1968).

    Google Scholar 

  3. Berge, C. Some classes of perfect graphs, Graph Theory and Theoretical Physics, edited by Frank Harary. Academic Press, London, 155–165 (1967).

    Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Dowling, T.A. A characterization of the Tm graph. J. Combinatorial Theory 6, 251–263 (1969).

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Hall, M., Jr. Combinatorial Theory. Blaisdell, Waltham, Mass., 1967.

    MATH  Google Scholar 

  8. Harary, F. Graph Theory. Addison-Wesley, 1969.

    Google Scholar 

  9. Hoffman, A.J. On the line graph of a projective plane. Proc. Amer. Math. Soc. 16, 297–302 (1965).

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Hoffman, A.J. and Ray-Chaudhuri, D.K. On the line graph of a symmetric balanced incomplete block design. Trans. Amer. Math. Soc. 116, 238–252 (1965).

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. König, D. Theorie der endlichen and unendlichen graphen. Leipzig, 1936; reprinted Chelsea, New York, 1950.

    Google Scholar 

  12. Krauz, J. Démonstration nouvelle d’une théoreme de Whitney sur les réseaux. Mat. Fiz. Lapek 50, 75–89 (1943).

    MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  14. Ore, O. Theory of Graphs. Amer. Math. Soc. Colloq. Publ. 38, Providence, 1962.

    Google Scholar 

  15. Roberts, F. and Spencer, J. A characterization of clique graphs. Memorandum RM-5933-PR, The Rand Corp., Santa Monica, Calif., February, 1969.

    Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1971 Springer-Verlag

About this paper

Cite this paper

Hedetniemi, S.T. (1971). Graphs of (0,1)-matrices. In: Capobianco, M., Frechen, J.B., Krolik, M. (eds) Recent Trends in Graph Theory. Lecture Notes in Mathematics, vol 186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0059433

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-05386-6

  • Online ISBN: 978-3-540-36508-2

  • eBook Packages: Springer Book Archive