scientific article; zbMATH DE number 3825879

zbMATH Open0522.05068MaRDI QIDQ3672040FDOQ3672040

Authors: Dragoš Cvetković 

Publication date: 1983

Full work available at URL: https://eudml.org/doc/116830

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Title of this publication is not available (Why is that?)

zbMATH Keywords

expert systemconjectures in graph theorygraph theoretical algorithmssystem Graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Cited In (8)

• Man-machine theorem proving in graph theory
• Computers and discovery in algebraic graph theory
• Facet defining inequalities among graph invariants: The system graphedron
• A few examples and counterexamples in spectral graph theory
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• Spectra of unicyclic graphs
• When can the components of NEPS of connected bipartite graphs be almost cospectral?
• On the components of NEPS of connected bipartite graphs

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 Q3672040)