A computational attack on the conjectures of Graffiti: New counterexamples and proofs

DOI10.1016/0012-365X(94)00227-AzbMath0838.05098OpenAlexW2129891898WikidataQ123111326 ScholiaQ123111326MaRDI QIDQ1910505

Tony L. Brewster, Michael J. Dinneen, Vance Faber

Publication date: 24 March 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00227-a

zbMATH Keywords

computer programcounterexamplesgraph invariantsGraffiti conjectures

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items (3)

Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number ⋮ Distance spectra of graphs: a survey ⋮ Computers and discovery in algebraic graph theory

Uses Software

• GRAFFITI

Cites Work

• On conjectures of Graffiti
• An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with Its Laplacian
• Properties of the family of independent subsets of a general algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A computational attack on the conjectures of Graffiti: New counterexamples and proofs