scientific article; zbMATH DE number 3825879

MaRDI QIDQ3672040zbMATH OpenFDO

Authors Dragoš Cvetković

Publication date 1983

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

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

zbMATH Keywords

conjectures in graph theoryexpert systemgraph theoretical algorithmssystem Graph

Mathematics Subject Classification ID

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

Cited in

(12)

• Spectra of unicyclic graphs
• Man-machine theorem proving in graph theory
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
• When can the components of NEPS of connected bipartite graphs be almost cospectral?
• On the components of NEPS of connected bipartite graphs
• Computers and discovery in algebraic graph theory
• A few examples and counterexamples in spectral graph theory
• Discussing Diophantine problems with a large language model
• A note on almost cospectrality of components of NEPS of bipartite graphs
• Reinforcement learning for graph theory. I: Reimplementation of Wagner's approach
• The NEPS of gain graphs over arbitrary groups and its spectra
• Facet defining inequalities among graph invariants: The system graphedron

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)