Computer based proofs by induction in graph theory - A house of cards?

DOI10.1016/0895-7177(93)90247-VzbMath0800.68630OpenAlexW2050100518MaRDI QIDQ1310223

A. P. Mullhaupt, Curtiss Barefoot, Roger Entringer

Publication date: 4 December 1994

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(93)90247-v

zbMATH Keywords

computer based proofscomputer generated datagraph theorems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Computers and discovery in algebraic graph theory

Uses Software

• GRAFFITI

Cites Work

• Smallest maximally nonhamiltonian graphs
• Properties of almost all graphs and complexes
• A census of maximum uniquely hamiltonian graphs
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Characterization of maximum critically 2-connected graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computer based proofs by induction in graph theory - A house of cards?