The ultimate categorical matching in a graph

Discrete Mathematics

Volumn 232, Issue 1-3, 2001, Pages 1-9

  Albert, Michael H ^a   Holton, Derek ^a   Nowakowski, Richard J ^b  

^a UNIVERSITY OF OTAGO   (New Zealand)

^b DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Bipartite; Matching; Ultimate categorical matching

Indexed keywords

EID: 0035815382     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00181-3     Document Type: Article

References (11)

1. J.I. Brown, R.J. Nowakowski, D. Rall, The ultimate categorical independence ratio, SIAM J. Discrete Math. 9 (1996) 290-300.
2. G. Chartrand, L. Lesniak, Graphs and Digraphs, Prindle, Weber & Schmidt International Series, Boston, 1986.
3. E.N. Gilbert, Unpublished Technical Memorandum, Bell Telephone Laboratories, Murray Hill, NJ, 1972.
4. F. Harary, Graph Theory, Addison-Wesley, London, 1972.
5. P. Hell, F.S. Roberts, Analogues of the Shannon capacity of a graph, in: A. Rosa, G. Sabidussi, J. Turgeon (Eds.), Theory and Practice of Combinatorics, SE-North-Holland Mathematical Studies, Vol. 60, North-Holland, Amsterdam, 1982, pp. 155-168.
6. P. Hell, X. Yu, H. Zhou, Independence ratios of graph powers, Discrete Math. 27 (1994) 213-220.
7. A.J.W. Hilton, R. Rado, S.H. Scott, A (< 5)-colour theorem for planar graphs, Bull. London Math. Soc. 5 (1973) 302-306.
8. L. Lovász, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory 25 (1979) 1-7.
9. F.S. Roberts, Graph Theory and its Applications to Problems of Society, CBMS-NSF Monographs No. 29, SIAM, Philadelphia, PA, 1978.
10. M. Rosenfeld, On a problem of C.E. Shannon in graph theory, Proc. Amer. Math. Soc. 18 (1967) 315-319.
11. C.E. Shannon, The zero error capacity of a noisy channel, I.R.E., Trans. Inform. Theory IT-2 (1956) 8-19.