Computers and discovery in algebraic graph theory
type: Item
instance of: scholarly article
title: Computers and discovery in algebraic graph theory
zbMATH Open document ID: 1015.05087
DOI: 10.1016/S0024-3795(02)00386-5
author: Pierre Hansen
author: Hadrien Mélot
published in: Linear Algebra and its Applications
publication date: 2003-02-05T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 1864762
zbMATH Keywords: conjectures
zbMATH Keywords: refutations
zbMATH Keywords: algebraic graph theory
Wikidata QID: Q115202383
describes a project that uses: GAP
describes a project that uses: INGRID
describes a project that uses: Grappa
describes a project that uses: GRAFFITI
describes a project that uses: GRAPE
describes a project that uses: GraphBase
describes a project that uses: MOLGEN
describes a project that uses: nauty
describes a project that uses: AutoGraphiX
describes a project that uses: LEDA
describes a project that uses: Mathematica
describes a project that uses: Matlab
describes a project that uses: GRAPH
describes a project that uses: daVinci
MaRDI profile type: Publication
cites work: Q4529449
cites work: Every planar map is four colorable. I: Discharging
cites work: Every planar map is four colorable. II: Reducibility
cites work: Every Planar Map is Four Colorable
cites work: Sale of the century?
cites work: Q4796697
cites work: The nonregular, bipartite, integral graphs with maximum degree 4. I: Basic properties
cites work: Computer based proofs by induction in graph theory - A house of cards?
cites work: Q4187840
cites work: The set player system for symbolic computation on power sets
cites work: A computational attack on the conjectures of Graffiti: New counterexamples and proofs
cites work: Q3318779
cites work: A compilation of relations between graph invariants
cites work: A compilation of relations between graph invariants—supplement I
cites work: INGRID: A graph invariant manipulator
cites work: Fast generation of cubic graphs
cites work: Q4511019
cites work: Q4147995
cites work: Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
cites work: Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
cites work: The point-arboricity of a graph
cites work: The average distance and the independence number
cites work: The smallest triangle-free 4-chromatic 4-regular graph
cites work: Q4735209
cites work: A surprising isomorphism
cites work: Hexagon-free subgraphs of hypercubes
cites work: Automorphism groups of symmetric graphs of valency 3
cites work: Q3908985
cites work: Q3215235
cites work: Q3672040
cites work: Q3315555
cites work: Q3812289
cites work: Recent results in the theory of graph spectra
cites work: Q4327350
cites work: Q3684166
cites work: Man-machine theorem proving in graph theory
cites work: Variable neighborhood search for extremal graphs 3
cites work: Algorithms for drawing graphs: An annotated bibliography
cites work: Q3154375
cites work: Q3985344
cites work: Lower bounds for the clique and the chromatic numbers of a graph
cites work: Knowledge representation for mathematical discovery: Three experiments in graph theory
cites work: Q3197865
cites work: On conjectures of Graffiti
cites work: Q3197866
cites work: Q3211357
cites work: Q4871155
cites work: Q4198513
cites work: Q3922724
cites work: Q4237398

Computers and discovery in algebraic graph theory (cites work)
cites work: Q4284633

Computers and discovery in algebraic graph theory (cites work)
cites work: Q4711896

Computers and discovery in algebraic graph theory (cites work)
cites work: On the residue of a graph

Computers and discovery in algebraic graph theory (cites work)
cites work: Some eigenvalue properties in graphs (conjectures of Graffiti -- II)

Computers and discovery in algebraic graph theory (cites work)
cites work: Q4050625

Computers and discovery in algebraic graph theory (cites work)
cites work: Minimal antichains in well-founded quasi-orders with an application to tournaments

Computers and discovery in algebraic graph theory (cites work)
cites work: Q4015432

Computers and discovery in algebraic graph theory (cites work)
cites work: Q5753988

Computers and discovery in algebraic graph theory (cites work)
cites work: Q4800102

Computers and discovery in algebraic graph theory (cites work)
cites work: Variable neighborhood search: Principles and applications

Computers and discovery in algebraic graph theory (cites work)
cites work: Sharp bounds on the order, size, and stability number of graphs

Computers and discovery in algebraic graph theory (cites work)
cites work: Q5682013

Computers and discovery in algebraic graph theory (cites work)
cites work: Q3140399

Computers and discovery in algebraic graph theory (cites work)
cites work: Finitely constrained classes of homogeneous directed graphs

Computers and discovery in algebraic graph theory (cites work)
cites work: Q5615946

Computers and discovery in algebraic graph theory (cites work)
cites work: Q3880849

Computers and discovery in algebraic graph theory (cites work)
cites work: On the eigenvalues of trees

Computers and discovery in algebraic graph theory (cites work)
cites work: Isomorph-Free Exhaustive Generation

Computers and discovery in algebraic graph theory (cites work)
cites work: The design of an extendible graph editor

Computers and discovery in algebraic graph theory (cites work)
cites work: Computation of the Folkman numberFe(3, 3; 5)

Computers and discovery in algebraic graph theory (cites work)
cites work: Q4331782

Computers and discovery in algebraic graph theory (cites work)
cites work: Q3754022

Computers and discovery in algebraic graph theory (cites work)
cites work: Q4343033

Computers and discovery in algebraic graph theory (cites work)
cites work: Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations

Computers and discovery in algebraic graph theory (cites work)
cites work: The Enumeration of Locally Restricted Graphs (I)

Computers and discovery in algebraic graph theory (cites work)
cites work: The four-colour theorem

Computers and discovery in algebraic graph theory (cites work)
cites work: Q3781788

Computers and discovery in algebraic graph theory (cites work)
cites work: Q3824447

Computers and discovery in algebraic graph theory (cites work)
cites work: Q4000231

Computers and discovery in algebraic graph theory (cites work)
cites work: Q4273617

Computers and discovery in algebraic graph theory (cites work)
cites work: Three new distance-regular graphs

Computers and discovery in algebraic graph theory (cites work)
cites work: A bound on the spectral radius of graphs with \(e\) edges