Partitioning of loop-free sperner hypergraphs into transversals

International Journal of Pure and Applied Mathematics

Volumn 88, Issue 4, 2013, Pages 469-474

  Dharmarajan, R ^a,b   Palaniammal, S ^a,c  

^a BHARATHIAR UNIVERSITY   (India)

^b SASTRA UNIVERSITY   (India)

^c SRI KRISHNA COLLEGE OF TECHNOLOGY   (India)

Author keywords

Hyperedge; Hypergraph; Partition; Sperner; Transversal

Indexed keywords

EID: 84887773887     PISSN: 13118080     EISSN: 13143395     Source Type: Journal    
DOI: 10.12732/ijpam.v88i4.2     Document Type: Article

References (6)

1. C. Berge, Hypergraphs-Combinatorics of finite sets, North-Holland Math- ematical Library, Holland (1989).
2. R. Dharmarajan, D. Ramachandran, On connections between dominating sets and transversals in simple hypergraphs, International Journal of Pure and Applied Mathematics, 80, No. 5 (2012), 21-26.
3. T. Eiter, G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, SIAM Journal on Computing, 24, No . 6 (1995), 1278-1304, doi: 10.1137/S0097539793250299.
4. John M. Harris, Jeffry L. Hirst, Michael J. Mossinghoff, Combinatorics and Graph Theory, Springer, USA (2008), doi: 10.1007/978-0-387-79711-3.
5. K.H. Rosen, Handbook of Discrete and Combinatorial Mathematics, CRC Press LLC, USA (2000).
6. R.R. Stoll, Set Theory and Logic, Dover, USA (1963).