Minimum clique bicoloring
From MaRDI portal
Cites work
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithmic Aspects of Neighborhood Numbers
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Approximating rank-width and clique-width quickly
- Clique coloring \(B_1\)-EPG graphs
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Clique-coloring some classes of odd-hole-free graphs
- Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
- Coloring the hypergraph of maximal cliques of a graph with no long path
- Coloring the Maximal Cliques of Graphs
- Complete sets and the polynomial-time hierarchy
- Complexity of clique coloring and related problems
- Computational Complexity
- Distance-hereditary graphs are clique-perfect
- Exact exponential algorithms.
- Fibres and ordered set coloring
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Fourier meets M\"{o}bius: fast subset convolution
- Graph theory (to appear)
- Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- Integral boundary points of convex polyhedra
- Linear time solvable optimization problems on graphs of bounded clique-width
- On promise problems: a survey
- On the complexity of bicoloring clique hypergraphs of graphs
- Parametrized complexity theory.
- Some simplified NP-complete graph problems
- The complexity of first-order and monadic second-order logic revisited
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Two-colouring all two-element maximal antichains
This page was built for publication: Minimum clique bicoloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363395)
