Interpolation theorems for graphs, hypergraphs and matroids

Discrete Mathematics

Volumn 185, Issue 1-3, 1998, Pages 221-229

  Zhou, Sanming ^a  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0042496340     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00173-8     Document Type: Article

References (23)

1. C. Berge, Hypergraphs, North-Holland, Amsterdam, 1989.
2. C. Berge, P. Duchet, A generalization of Gilmore's theorem, in: M. Fiedler (Ed.), Recent Advances in Graph Theory, Academia, Praha, 1975.
3. B. Bollobás, E.J. Cockayne, C.M. Mynhardt, On generalized minimal domination parameters for paths, Discrete Math. 86 (1990) 89-97.
4. G. Chartrand, T. Alavi, D.L. Goldsmith, L. Lesniak, D.R. Lick, The Theory and Applications of Graphs, Proc. 4th Internat. Conf., 1980, Wiley, 1981, p. 610.
5. E.J. Cockayne, O. Favaron, C. Payan, A.G. Thomason, Contributions to the theory of domination, independence and irredundance in graphs, Discrete Math. 33 (1981) 249-258.
6. E.J. Cockayne, G.G. Miller, G. Prins, An interpolation theorem for partitions which are complete with respect to hereditary properties, J. Combin. Theory Ser. B 13 (1972) 290-297.
7. T. Gallai, Über extreme Punkt- und Kantenmengen, Ann. Univ. Sci. Budapest, Eötvös Sect. Math. 2 (1959) 133-138.
8. F. Harary, Covering and packing in graphs I, Ann. New York Acad. Sci. 175 (1970) 198-205.
9. F. Harary, Conditional colorability in graphs, in: F. Harary, J.S. Maybee (Eds.), Graphs and Applications, Wiley, New York, 1985, pp. 127-136.
10. F. Harary, S. Hedetniemi, C. Prins, An interpolation theorem for graphical homomorphisms, Portugal. Math. 26 (1967) 454-462.
11. F. Harary, R.J. Mokken, M. Plantholt, Interpolation theorem for diameters of spanning trees, IEEE Trans. Circuits Systems CAS 30 (1983) 429-431.
12. F. Harary, M. Plantholt, Classification of interpolation theorems for spanning trees and other families of spanning subgraphs, J. Graph Theory 13 (1989) 703-712.
13. S.T. Hedetniemi, Hereditary properties of graphs, J. Combin. Theory Ser. B 14 (1973) 94-99.
14. C.A. Holzmann, F. Harary, On the tree graph of a matroid, SIAM J. Appl. Math. 22 (2) (1972) 187-193.
15. B. Korte, L. Lovász, Basis graphs of greedoids and two-connectivity, Math. Program. Study 24 (1985) 158-165.
16. B. Korte, L. Lovász, R. Schrader, Greedoids, Springer, Berlin, 1991.
17. Y.X. Lin, A simpler proof of interpolation theorem for spanning trees, Kexue Tongbao 30 (1985) 134.
18. S. Schuster, Interpolation theorem for the number of end-vertices of spanning trees, J. Graph Theory 7 (1983) 203-208.
19. D.J.A. Welsh, Matroid Theory, Academic Press, London, 1976.
20. B. Zelinka, Domatic number of a graph and its variants, in: J. Nešetřil, M. Fiedler (Eds.), Annals of Discrete Math. vol. 51, Proc. 4th Czechoslovakian Symp. on Combin., Graphs and Complexity, North-Holland, Amsterdam, 1992, pp. 363-369.
21. S.M. Zhou, Some interpolation theorems of graphs, Math. Appl. 4 (1) (1991) 64-69.
22. S.M. Zhou, Conditional invariants and interpolation theorems for graphs, submitted.
23. S.M. Zhou, On f-domination number of a graph, Czechoslovak Math. J. 46 (121) (1996) 489-499.