On conjectures of Graffiti (Q922723): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q105709360, #quickstatements; #temporary_batch_1709550817224 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q105709360 / rank | |||
Normal rank |
Revision as of 12:31, 4 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On conjectures of Graffiti |
scientific article |
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