Computers and discovery in algebraic graph theory
From MaRDI portal
Publication:1855400
DOI10.1016/S0024-3795(02)00386-5zbMath1015.05087WikidataQ115202383 ScholiaQ115202383MaRDI QIDQ1855400
Publication date: 5 February 2003
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Related Items
Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships, Facet defining inequalities among graph invariants: The system graphedron, Variable neighbourhood search: methods and applications, On the two conjectures of Graffiti
Uses Software
Cites Work
- A surprising isomorphism
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Lower bounds for the clique and the chromatic numbers of a graph
- On conjectures of Graffiti
- Man-machine theorem proving in graph theory
- INGRID: A graph invariant manipulator
- Knowledge representation for mathematical discovery: Three experiments in graph theory
- The set player system for symbolic computation on power sets
- Recent results in the theory of graph spectra
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- The design of an extendible graph editor
- Computer based proofs by induction in graph theory - A house of cards?
- Three new distance-regular graphs
- Algorithms for drawing graphs: An annotated bibliography
- The four-colour theorem
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- A bound on the spectral radius of graphs with \(e\) edges
- Automorphism groups of symmetric graphs of valency 3
- Minimal antichains in well-founded quasi-orders with an application to tournaments
- A computational attack on the conjectures of Graffiti: New counterexamples and proofs
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- The point-arboricity of a graph
- On the eigenvalues of trees
- Variable neighborhood search for extremal graphs 3
- Hexagon-free subgraphs of hypercubes
- The Enumeration of Locally Restricted Graphs (I)
- A compilation of relations between graph invariants
- The average distance and the independence number
- On the residue of a graph
- A compilation of relations between graph invariants—supplement I
- Every Planar Map is Four Colorable
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Computation of the Folkman numberFe(3, 3; 5)
- Finitely constrained classes of homogeneous directed graphs
- Isomorph-Free Exhaustive Generation
- Fast generation of cubic graphs
- Sharp bounds on the order, size, and stability number of graphs
- The smallest triangle-free 4-chromatic 4-regular graph
- Variable neighborhood search: Principles and applications
- Sale of the century?
- The nonregular, bipartite, integral graphs with maximum degree 4. I: Basic properties
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
