Forcing structures and cliques in uniquely vertex colorable graphs (Q2753535)
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: Forcing structures and cliques in uniquely vertex colorable graphs |
scientific article; zbMATH DE number 1670340
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Forcing structures and cliques in uniquely vertex colorable graphs |
scientific article; zbMATH DE number 1670340 |
Statements
11 November 2001
0 references
uniquely vertex colorable graphs
0 references
clique number
0 references
0 references
0.89128256
0 references
0.8910677
0 references
0.8878253
0 references
0 references
0.8789917
0 references
0.8789917
0 references
0 references
0.8747402
0 references
Forcing structures and cliques in uniquely vertex colorable graphs (English)
0 references
The paper deals with uniquely colorable graphs. First, a construction of uniquely \(k\)-colorable graphs with clique number \(k-t\) is presented for every \(t\) and for every sufficiently large \(k\). Second, bounds on the minimum number of edges and vertices in a uniquely \(k\)-colorable graph with clique number \(k-t\) are provided.
0 references
