Chapter PDF
References
B. Andrásfai, On critical graphs, Théorie des Graphes (Rome I.C.C.), Paris, (1967), 9–19.
C. Berge, Graphes et Hypergraphes (Dunod, Paris, 1970).
C. Berge, Une propriete des graphes k-stables critiques, Combinatorial Structures (Gordon and Breach, New York, 1970) 7–11.
C. Berge, Regularizable Graphs, Proc. I.S.I. Conference on Graph Theory, Calcutta, 1976.
C. Berge, Regularizable Graphs, Annals of Discrete Math. 3 (1978) 11–19.
R. A. Brualdi, Combinatorial Properties of symmetric non-negative matricies, Coll. Th. Combinat. Rome, 2 (1976) 99–120.
G. Cornuejols, W. Pulleyblank, A matching problem with side conditions, Discrete Math. 29 (1980) 135–139.
P. Erdös, T. Gallai, On the minimal number of vertices representing the edges of a graph, Publ. Math. Inst. Hung. Acad. Sci. 6 (1961) 181–203.
D. R. Fulkerson, A. J. Hoffman, M. H. McAndrew, Some properties of graphs with multiple edges, Can. J. Math. (1965) 166–177.
A. George, On line-critical graphs, Thesis, Vanderbilt Univ., Nashville, TN (1971).
A. Hajnal, A theorem on k-saturated graphs, Can. J. Math. 17 (1965) 720–772.
F. Jaeger, C. Payan, A class of regularizable graphs, Annals of Discrete Math. 3 (1978) 125–127.
M. Las Vergnas, A note on matchings, Acts Coll. Brussells, CER, 17, 1975, 255–260.
G. L. Nemhauser, L. E. Trotter, Vertex packings: structural properties and algorithms, Math. Programming 8 (1975) 232–248.
M. D. Plummer, On a family of line critical graphs, Monatsh. Math. 71 (1967) 40–48.
M. D. Plummer, Some covering concepts in Graphs, J. Comb. Theory B (1970) 46–48.
W. R. Pulleyblank, Minimum node covers and 2-bicritical graphs, Math. Programming 17 (1979) 91–103.
G. Ravindra, Well coverd Graphs, I.I.T. Madras (1976).
G. Ravindra, B-Graphs, Symposium on Graph Theory, I.S.I. (1976).
F. Sterboul, A characterization of the graphs in which the transversal number equals the matching number, J. Comb. Theory B 27 (1979) 228–229.
D. P. Sumner, Graphs with 1-factors, Proc. Am. Math. Soc. 42, 1974, 8–12.
L. Suranyi, On line-critical graphs, Infinite and finite sets, (North Holland, Amsterdam, 1975) 1411–1444.
W. Tutte, The factors of graphs, Canad. J. Math. 4 (1952) 314–328.
A. A. Zykov, On some properties of linear complexes, Math. USSR Sb. 24 (1949) 163–188.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berge, C. (1981). Some common properties for regularizable graphs, edge-critical graphs and b-graphs. In: Saito, N., Nishizeki, T. (eds) Graph Theory and Algorithms. Lecture Notes in Computer Science, vol 108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10704-5_10
Download citation
DOI: https://doi.org/10.1007/3-540-10704-5_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10704-0
Online ISBN: 978-3-540-38661-2
eBook Packages: Springer Book Archive