Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs |
scientific article; zbMATH DE number 6705192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs |
scientific article; zbMATH DE number 6705192 |
Statements
Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (English)
0 references
12 April 2017
0 references
unichord-free graph
0 references
decomposition
0 references
hypergraphs
0 references
clique colouring
0 references
biclique colouring
0 references
0.97959303855896
0 references
0.8292911648750305
0 references
0.8156173229217529
0 references
0.8097440004348755
0 references
0.7782851457595825
0 references
