A Classification of Graph Capacity Functions

Journal of Graph Theory

Volumn 21, Issue 3, 1996, Pages 251-265

  Hsu, Lih Hsing ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030546091     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199603)21:3<251::AID-JGT1>3.0.CO;2-P     Document Type: Article

References (11)

1. J. A. Bondy and U. S. R. Murty, Graph theory with applications, Elsevier Science Publishing, New York (1976).
2. S. T. Hedetniemi, Homomorphisms of Graphs and Automata, Doctoral Dissertation, University of Michigan, Ann Arbor (1966).
3. L. H. Hsu, On a multiplicative graph function conjecture, Discrete Math. 45 (1983), 245-253.
4. L. H. Hsu, Generalized homomorphism graph functions, Discrete Math. 83 (1990), 31-37.
5. L. H. Hsu, C. Chen, and E. Y. Jean, A class of additive multiplicative graph functions, Discrete Math. 65 (1987), 53-63.
6. L. H. Hsu and S. F. Hwang, Graph capacity equivalence relation, Chinese J. Math. 17 (1989), 191-205.
7. S. F. Hwang and L. H. Hsu, Capacity equivalent class for graphs with fixed odd girth, Tamkang J. Math. 20 (1989), 159-167.
8. L. Lovász, Kneser's conjecture, chromatic number, and homotoph, J. Combin. Theory, Ser. A 25 (1978), 319-324.
9. L. Lovász, Personal communication to J. Spenser.
10. J. Mycielski, Sur le coloriage des graphs, Colloq. Math. 3 (1955), 161-162.
11. C. E. Shannon, The zero-error capacity of a noisy channel, Comp. Information Theory, IRE Trans. (1956), 3-15.