scientific article
From MaRDI portal
Publication:3318779
zbMath0535.05001MaRDI QIDQ3318779
Robert C. Brigham, Ronald D. Dutton
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs ⋮ INGRID: A graph invariant manipulator ⋮ On the size of graphs of a given bandwidth ⋮ Automated conjecturing. III. Property-relations conjectures ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures ⋮ Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships ⋮ INGRID ⋮ Upper bounds on the edge clique cover number of a graph ⋮ Computers and discovery in algebraic graph theory
