scientific article; zbMATH DE number 3849229
From MaRDI portal
Publication:3318779
zbMATH Open0535.05001MaRDI QIDQ3318779FDOQ3318779
Authors: Robert Brigham, Ronald D. Dutton 
Publication date: 1983
Title of this publication is not available (Why is that?)
Recommendations
- INGRID: A graph invariant manipulator
- A compilation of relations between graph invariants—supplement I
- Variable neighborhood search for extremal graphs. XIV: The AutoGraphiX 2 system
- Variable neighborhood search for extremal graphs. 20. Automated comparison of graph invariants
- scientific article; zbMATH DE number 4128857
Extremal problems in graph theory (05C35) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Cited In (13)
- Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
- Computers and discovery in algebraic graph theory
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- INGRID
- Title not available (Why is that?)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- INGRID: A graph invariant manipulator
- A compilation of relations between graph invariants—supplement I
- Automated conjecturing. III. Property-relations conjectures
- GrInvIn in a nutshell
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs
- Upper bounds on the edge clique cover number of a graph
- On the size of graphs of a given bandwidth
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3318779)
