Some covering concepts in graphs

Journal of Combinatorial Theory - Tập 8 - Trang 91-98 - 1970
Michael D. Plummer1
1Department of Mathematics, Yale University, New Haven, Connecticut 06520 USA

Tài liệu tham khảo

Andrásfai, 1967, On Critical Graphs, Theory of Graphs, 9 Beineke, 1967, On the Critical Lines of a Graph, Pacific J. Math., 3, 205, 10.2140/pjm.1967.22.205 Dulmage, 1958, Coverings of Bipartite Graphs, Canad. J. Math., 10, 517, 10.4153/CJM-1958-052-0 Dulmage, 1959, A Structure Theory of Bipartite Graphs of Finite Exterior Dimension, Trans. Roy. Soc. Canada Sect. III, 53, 1 Erdös, 1961, On the Minimal Number of Vertices Representing the Edges of a Graph, Publ. Math. Inst. Hungar. Acad. Sci., 6, 181 Erdös, 1964, A Problem in Graph Theory, Amer. Math. Monthly, 71, 1107, 10.2307/2311408 Hajnal, 1965, A Theorem on k-Saturated Graphs, Canad. J. Math., 17, 720, 10.4153/CJM-1965-072-1 Harary, 1967 Harary, 1967, On the Core of a Graph, Proc. London Math. Soc., 17, 305, 10.1112/plms/s3-17.2.305 Harary, 1967, On Indecomposable Graphs, Canad. J. Math., 19, 800, 10.4153/CJM-1967-074-7