Pseudo-chordal mixed hypergraphs

Discrete Mathematics

Volumn 202, Issue 1-3, 1999, Pages 239-248

  Voloshina, Vitaly I ^a   Zhou, Huishan ^b  

^a INSTITUTE OF CHEMISTRY   (Moldova)

^b GEORGIA STATE UNIVERSITY   (United States)

Author keywords

Chordal; Chromatic polynomial; Mixed hypergraphs; Pseudo chordal; Upper chromatic number

Indexed keywords

EID: 0041705526     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0012-365x(98)00295-7     Document Type: Article

References (12)

1. R. Ahlswede, N. Cai, Z. Zhang, Rich colorings with local constraints, Journal of Combinatorics, Inform. System Sci. 17 (1992) 203-216.
2. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
3. C. Berge, Graphs, North-Holland, Amsterdam, 1985.
4. C. Berge, Hypergraphs: Combinatorics of Finite Sets, North-Holland, Amsterdam, 1989.
5. K. Diao, P. Zhao, H. Zhou, About the upper chromatic number of a co-hypergraph, Discrete Math., to appear.
6. G.A. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg 25 (1961) 71-76.
7. A. Hajnal, J. Suranyi, Über die Auflösung von Graphen in vollständige Teilgraphen, Ann. Univ. Sci. Budapest Eötvös Sect. Math. 1 (1958) 113-121.
8. Zs. Tuza, V. Voloshin, H. Zhou, Uniquely colorable mixed hypergraphs, submitted.
9. V. Voloshin, Hypergraphs-trees. Preprint No, 1516-82 Dep., Kishinev State University, Kishinev, 1982, 19 pp. (in Russian).
10. V. Voloshin, On the upper chromatic number of a hypergraph, Scientific Research Conf. of the Moldova State University, Abstracts of Reports, part 1, Moldova State University, Kishinev, 1992, p.42.
11. V. Voloshin, The mixed hypergraphs, Comput. Sci. J. Moldova 1 (1) (1993) 45-52.
12. V. Voloshin, On the upper chromatic number of a hypergraph, Australasian J. Combin. 11 (1995) 25-45.