Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809): Difference between revisions

@@ Property / cites work @@
+Coloring the Maximal Cliques of Graphs
@@ Property / cites work: Coloring the Maximal Cliques of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs
+Normal rank
@@ Property / cites work @@
+Complexity of clique-coloring odd-hole-free graphs
+Normal rank
@@ Property / cites work @@
+Generating bicliques of a graph in lexicographic order
+Normal rank
@@ Property / cites work @@
+On the generation of bicliques of a graph
@@ Property / cites work: On the generation of bicliques of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-Colouring and Biclique-Colouring Unichord-Free Graphs
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On independent sets and bicliques in graphs
@@ Property / cites work: On independent sets and bicliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Star and Biclique Coloring and Choosability Problems
+Normal rank
@@ Property / cites work @@
+Biclique graphs and biclique matrices
@@ Property / cites work: Biclique graphs and biclique matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Q5286666
@@ Property / cites work: Q5286666 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: an ongoing guide
@@ Property / cites work: The NP-completeness column: an ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of bicoloring clique hypergraphs of graphs
+Normal rank
@@ Property / cites work @@
+Total chromatic number of {square,unichord}-free graphs
+Normal rank
@@ Property / cites work @@
+Total chromatic number of unichord-free graphs
@@ Property / cites work: Total chromatic number of unichord-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Chromatic index of graphs with no cycle with a unique chord
+Normal rank
@@ Property / cites work @@
+On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Complexity of clique coloring and related problems
+Normal rank
@@ Property / cites work @@
+Total colouring regular bipartite graphs is NP-hard
+Normal rank
@@ Property / cites work @@
+A fast algorithm for building lattices
@@ Property / cites work: A fast algorithm for building lattices / rank @@
+Normal rank
@@ Property / cites work @@
+A fast incremental algorithm for building lattices
+Normal rank
@@ Property / cites work @@
+Bicliques in graphs. I: Bounds on their number
@@ Property / cites work: Bicliques in graphs. I: Bounds on their number / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A structure theorem for graphs with no cycle with a unique chord and its consequences
+Normal rank
@@ Property / cites work @@
+Node-and edge-deletion NP-complete problems
@@ Property / cites work: Node-and edge-deletion NP-complete problems / rank @@
+Normal rank