Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs

Theoretical Computer Science

Volumn 295, Issue 1-3, 2003, Pages 263-278

  Král', Daniel ^a   Kratochvíl, Jan ^a   Voss, Heinz Jürgen ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Approximation algorithms for coloring; Coloring of hypergraphs; Mixed hypergraphs

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; SET THEORY;

HYPERGRAPHS;

GRAPH THEORY;

EID: 0037463540     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00408-5     Document Type: Conference Paper

References (17)

1. Berman P., Fujito T. On approximation properties of the independent set problem for degree 3 graphs. Proc. WADS'95. Lecture Notes in Computer Science. Vol. 955:1995;449-460 Springer, Berlin.
2. C. Colbourn, J. Dinitz, A. Rosa, Bicoloring Triple Systems, Electronic J. Combin. 25(6#1), 16.
3. Ch.J. Colbourn, A. Rosa, Triple Systems, sect. 18.6, Strict colouring and the upper chromatic number, Clarendon Press, Oxford, 1999, pp. 340-341.
4. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1990;MIT Press, Cambridge, MA.
5. Edmonds J. Maximum matching and a polyhedron with. 0,1 vertices J. Res. Nat. Bur. Standards B. 69:1965;125-130.
6. Etzion T., Hartman A. Towards a large set of Steiner quadruple systems. SIAM J. Discrete Math. 4:1991;182-195.
7. Jiang T., Mubayi D., Tuza Zs., Voloshin V., West D.B. The chromatic spectrum of mixed hypergraphs. Graphs Comb. 18:2002;309-318.
8. Kann V. Maximum bounded 3-dimensional matching is MAX SNP-complete. Inform. Process. Lett. 37:1991;27-35.
9. D. Král', On complexity of colouring mixed hypertrees, in: Proc. FCT'01, WEA'01, Lecture Notes in Computer Science, Vol. 2138, Springer, Berlin, 2001, pp. 516-524.
10. D. Král', J. Kratochvíl, A. Proskurowski, H.-J. Voss, Coloring mixed hypertrees, in: Proc. WG'00, Lecture Notes in Computer Science, Vol. 1928, Springer, Berlin, 2000, pp. 279-289.
11. Lefmann H., Rödl V., Thomas R. Monochromatic vs. multicolored paths. Graphs Combin. 8:1992;323-332.
12. L. Milazzo, On upper chromatic number for SQS(10) and SQS(16), Le Matematiche L, Catania, 1995, pp. 179-193.
13. Milazzo L., Tuza Zs. Upper chromatic number of Steiner triple and quadruple systems. Discrete Math. 174:1997;247-259.
14. Milazzo L., Tuza Zs. Strict colorings for classes of Steiner triple systems. Discrete Math. 182:1998;233-243.
15. Tarjan R.E. On the efficiency of a good but not linear set merging algorithm. J. ACM. 22:2:1975;215-225.
16. Voloshin V. The mixed hypergraphs. Comput. Sci. J. Moldova. 1:1993;45-52.
17. Voloshin V. On the upper chromatic number of a hypergraph. Austral. J. Combin. 11:1995;25-45.