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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aigner, M. The uniqueness of the cubic lattice graph. J. Combinatorial Theory 6, 282–297 (1969).
Beineke, L. Derived graphs and digraphs, Beiträge zur Graphentheorie (H. Sachs, H. Voss, and H. Walther, eds.). Teukner, Leipzig, 17–33 (1968).
Berge, C. Some classes of perfect graphs, Graph Theory and Theoretical Physics, edited by Frank Harary. Academic Press, London, 155–165 (1967).
Bose, R.C. and Laskar, R. A characterization of tetrahedral graphs. J. Combinatorial Theory 3, 366–385 (1967).
Dowling, T.A. A characterization of the Tm graph. J. Combinatorial Theory 6, 251–263 (1969).
Gilmore, P. and Hoffman, A.J. A characterization of comparability graphs and interval graphs. Canad. J. Math. 16, 539–548 (1964).
Hall, M., Jr. Combinatorial Theory. Blaisdell, Waltham, Mass., 1967.
Harary, F. Graph Theory. Addison-Wesley, 1969.
Hoffman, A.J. On the line graph of a projective plane. Proc. Amer. Math. Soc. 16, 297–302 (1965).
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).
König, D. Theorie der endlichen and unendlichen graphen. Leipzig, 1936; reprinted Chelsea, New York, 1950.
Krauz, J. Démonstration nouvelle d’une théoreme de Whitney sur les réseaux. Mat. Fiz. Lapek 50, 75–89 (1943).
Moon, J.W. On the line-graph of the complete bigraph. Ann. Math. Stat. 34, 664–667 (1963).
Ore, O. Theory of Graphs. Amer. Math. Soc. Colloq. Publ. 38, Providence, 1962.
Roberts, F. and Spencer, J. A characterization of clique graphs. Memorandum RM-5933-PR, The Rand Corp., Santa Monica, Calif., February, 1969.
Shrikhande, S.S. On a characterization of the triangular association scheme. Ann. Math. Stat. 30, 39–67 (1959).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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
