Cited By
View all- De Rezende SPotechin ARisse K(2023)Clique Is Hard on Average for Unary Sherali-Adams2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00008(12-25)Online publication date: 6-Nov-2023
A clique of a graph G is a complete subgraph maximal under inclusion and having at least two vertices. A clique-transversal set D of a graph G is a set of vertices of G such that D meets all cliques of G . The clique-transversal number, denoted by c ( G ...
Let &Ggr; be a distance-regular graph with diameter at least three and height h = 2, where h = {\rm{max}}\{i : p_{di}^d \ne 0 \} . Suppose that for every ý in &Ggr; and ß in &Ggr; d (ý), the induced subgraph on &Ggr; d (ý) ý &Ggr;2(ß) is a clique. ...
A clique of a graph G is defined as a complete subgraph maximal under inclusion and having at least two vertices. A clique-transversal set D of G is a subset of vertices of G such that D meets all cliques of G. The clique-transversal set problem is to ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inView or Download as a PDF file.
PDFView online with eReader.
eReaderView this article in HTML Format.
HTML Format