On the complexity of bicoloring clique hypergraphs of graphs

Journal of Algorithms

Volumn 45, Issue 1, 2002, Pages 40-54

  Kratochvíl, Jan ^a   Tuza, Zsolt ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; GRAPH THEORY; GRAPHIC METHODS; MAXIMUM PRINCIPLE; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY; TIME DOMAIN ANALYSIS;

BICOLORING CLIQUE HYPERGRAPHS; MAXIMAL CLIQUES; PLANAR GRAPHS; POLYNOMIAL TIME;

ALGORITHMS;

EID: 0036810606     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(02)00221-3     Document Type: Article

References (18)

1. T. Andreae, On the clique-transversal number of chordal graphs, Discrete Math. 191 (1998) 3-11.
2. T. Andreae, C. Flotow, On covering all cliques of a chordal graph, Discrete Math. 149 (1996) 299-302.
3. T. Andreae, M. Schughart, Zs. Tuza, Clique-transversal sets of line graphs and complements of line graphs, Discrete Math. 88 (1991) 11-20.
4. G. Bacsó, S. Gravier, A. Gyárfás, M. Preissmann, A. Sebõ, Colouring the maximal cliques of graphs. Manuscript, 1998.
5. D. Duffus, B. Sands, N. Sauer, R.E. Woodrow, Two-colouring all two-element maximal antichains, J. Combin. Theory Ser. A 57 (1991) 109-116.
6. P. Erdõs, T. Gallai, Zs. Tuza, Covering the cliques of a graph with vertices, Discrete Math. 108 (1992) 279-289.
7. P. Erdõs, L. Lovász, Problems and results on 3-chromatic hypergraphs and related questions, in: A. Hajnal, L. Lovász, V. Sós (Eds.), Infinite and Finite Sets, in: Colloq. Math. Soc. J. Bolyai, Vol. 10, North-Holland, Amsterdam, 1974, pp. 609-627.
8. M.R. Garey, D.S. Johnson, L. Stockmeyer, Some simplified NP-complete problems, Theoret. Comput. Sci. 1 (1976) 237-267.
9. F.O. Hadlock, Finding a maximum cut of a planar graph in polynomial time, SIAM J. Comput. 4 (1975) 221-225.
10. D.S. Johnson, C.H. Papadimitriou, M. Yannakakis, On generating all maximal independent sets, Inform. Process. Lett. 27 (1988) 119-123.
11. J. Kratochvíl, R. Škrekovski, Unpublished, February, 2000.
12. J. Kratochvíl, Zs. Tuza, Bicoloring clique hypergraphs (extended abstract), in: Proceedings of 11th Annual ACM symposium on Discrete Algorithms, SODA'00, San Francisco, January 2000, ACM and SIAM, 2000, pp. 40-41.
13. D. Lichtenstein, Planar formulae and their uses, SIAM J. Comput. 11 (1982) 329-343.
14. B. Mohar, R. Škrekovski, Grötzsch theorems for the hypergraph of maximal cliques, Electron. J. Combin. 6 (1999) #R26.
15. G.I. Orlova, Y.G. Dorfman, Finding the maximal cut in a graph, Engrg. Cybernetics 10 (1972) 502-504.
16. S. Poljak, Zs. Tuza, Maximum Cuts and Large Bipartite Subgraphs, in: DIMACS Ser. in Discrete Math. Theoret. Comput. Sci., Vol. 20, American Mathematical Society, Providence, RI, 1995, pp. 181-224.
17. T.J. Schaefer, The complexity of satisfiability problems, in: Proc. 10th Annual ACM Symposium on the Theory of Computing, 1978, pp. 216-226.
18. Zs. Tuza, Covering all cliques of a graph, Discrete Math. 86 (1990) 117-126.