On conjectures of Graffiti (Q922723)
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: On conjectures of Graffiti |
scientific article; zbMATH DE number 4170124
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On conjectures of Graffiti |
scientific article; zbMATH DE number 4170124 |
Statements
On conjectures of Graffiti (English)
0 references
1988
0 references
The above mentioned article introduces a computer program, Graffiti, which makes graph-theoretical conjectures. Graffiti has a library of certain types of graphs and it is capable of evaluating formulas formed from graph-theoretical invariants; a formula is a conjecture if none of the graphs known by the program is an counterexample. The structure and the performances of the program are described.
0 references
Graffiti computer program
0 references
