On the complexity of bicoloring clique hypergraphs of graphs
Authors:
- Jan Kratochvı&#x;lJKJan Kratochvı&#x;l
- Zsolt TuzaZTZsolt Tuza
- 1 October 2002
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 45 (1) , 40-54
Abstract
No abstract availableKeywords
Funding Information
- Hungarian Scientific Research Fund (GACˇ R 201/99/0242, LN00A056, OTKA T-026575, T-032969)
- Ministry of Education
This publication has 11 references indexed in Scilit:
- On the clique-transversal number of chordal graphsDiscrete Mathematics, 1998
- On covering all cliques of a chordal graphDiscrete Mathematics, 1996
- Covering the cliques of a graph with verticesDiscrete Mathematics, 1992
- Two-colouring all two-element maximal antichainsJournal of Combinatorial Theory, Series A, 1991
- Clique-transversal sets of line graphs and complements of line graphsDiscrete Mathematics, 1991
- Covering all cliques of a graphDiscrete Mathematics, 1990
- On generating all maximal independent setsInformation Processing Letters, 1988
- Planar Formulae and Their UsesSIAM Journal on Computing, 1982
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975