Computer based proofs by induction in graph theory - A house of cards?
type: Item
instance of: scholarly article
title: Computer based proofs by induction in graph theory - A house of cards?
zbMATH Open document ID: 0800.68630
DOI: 10.1016/0895-7177(93)90247-V
author: A. P. Mullhaupt
author: Curtiss Barefoot
author: R. C. Entringer
published in: Mathematical and Computer Modelling
publication date: 1994-12-04T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 475034
zbMATH Keywords: computer based proofs
zbMATH Keywords: computer generated data
zbMATH Keywords: graph theorems
describes a project that uses: GRAFFITI
MaRDI profile type: Publication
cites work: Characterization of maximum critically 2-connected graphs
cites work: Smallest maximally nonhamiltonian graphs
cites work: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
cites work: Q4873792
cites work: A census of maximum uniquely hamiltonian graphs
cites work: Properties of almost all graphs and complexes
cites work: Q3197865
cites work: Q3781134
full work available at URL: 0895-7177(93)90247-v
OpenAlex ID: W2050100518
description: scientific article; zbMATH DE number 475034