Pages that link to "Item:Q1104124"

The following pages link to Man-machine theorem proving in graph theory (Q1104124):

Displaying 11 items.

• A survey of automated conjectures in spectral graph theory (Q962119) (← links)
• Bounds and conjectures for the signless Laplacian index of graphs (Q968999) (← links)
• Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
• Gazing: An approach to the problem of definition and lemma use (Q1197385) (← links)
• \({\mathcal Z}\)-match: An inference rule for incrementally elaborating set instantiations (Q1319387) (← links)
• Operational research models in action, the result of international cooperation -- a potpourri (Q1390319) (← links)
• Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414) (← links)
• On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\) (Q1842163) (← links)
• Computers and discovery in algebraic graph theory (Q1855400) (← links)
• Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← links)
• Star partitions and the graph isomorphism problem (Q4853929) (← links)