Coloring the hypergraph of maximal cliques of a graph with no long path (Q1412673)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2009168
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Coloring the hypergraph of maximal cliques of a graph with no long path |
scientific article; zbMATH DE number 2009168 |
Statements
Coloring the hypergraph of maximal cliques of a graph with no long path (English)
0 references
25 November 2003
0 references
Graphs
0 references
Coloring
0 references
Maximal cliques
0 references
0.8087448477745056
0 references
0.7935169339179993
0 references
0.790154218673706
0 references
