scientific article; zbMATH DE number 3849229

MaRDI QIDQ3318779zbMATH OpenFDO

Authors Robert Brigham, Ronald D. Dutton

Publication date 1983

zbMATH Keywords

graph invariantsmachine supported logical inference

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Software, source code, etc. for problems pertaining to combinatorics (05-04)

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

Cited in

(13)

• Computers and discovery in algebraic graph theory
• Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• INGRID
• scientific article; zbMATH DE number 841660 (Why is no real title available?)
• Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
• INGRID: A graph invariant manipulator
• A compilation of relations between graph invariants—supplement I
• GrInvIn in a nutshell
• Automated conjecturing. III. Property-relations conjectures
• 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)