Abstract
A simple proof (using theorems of Hajnal and Tutte) of a characterization of odd cycles due to Melnikov and Vising is given.
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 subscriptionsReferences
Berge, C., Graphs and Hypergraphs, North Holland, (1973).
Hajnal, A., A theorem on k-saturated graphs, Canad. Math. J., 17(1965), 720–724.
Lovász, L., A characterization of perfect graphs, J. Combinatorial Theory, 13(1972), 95–98.
Melnikov, L.S., V.G. Vising, Solution of Toft's problem, Diskret. Analiz., 19(1971), 11–14.
Toft, A., Combinatorial Theory and its Applications III, (P. Erdos, A. Renyi and Vera T. Sos, eds.) North Holland Publishing Company, 1970, 1193.
Tutte, W.T., The l-factors of oriented graphs, Proc. Amer. Math. Soc., 4(1953), 922–931.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Greenwell, D. (1978). Odd cycles and perfect graphs. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070376
Download citation
DOI: https://doi.org/10.1007/BFb0070376
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08666-6
Online ISBN: 978-3-540-35912-8
eBook Packages: Springer Book Archive
