On some conjectures of Graffiti
From MaRDI portal
The computer program Galatea Gabriella Graffiti [\textit{S. Fajtlowicz}, University of Houston, 1996] made several conjectures concerning the chromatic numbers of graphs. The authors prove one of these conjectures, and disprove four.
Recommendations
Cites work
Cited in
(11)- A computational attack on the conjectures of Graffiti: New counterexamples and proofs
- scientific article; zbMATH DE number 4173028 (Why is no real title available?)
- scientific article; zbMATH DE number 4173029 (Why is no real title available?)
- scientific article; zbMATH DE number 4191740 (Why is no real title available?)
- scientific article; zbMATH DE number 4041962 (Why is no real title available?)
- scientific article; zbMATH DE number 1308947 (Why is no real title available?)
- Extremal problems for chromatic neighborhood sets
- scientific article; zbMATH DE number 5037208 (Why is no real title available?)
- scientific article; zbMATH DE number 5037209 (Why is no real title available?)
- Automated conjecturing with TxGraffiti
- On conjectures of Graffiti
This page was built for publication: On some conjectures of Graffiti
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377723)