Automated conjecturing with TxGraffiti
From MaRDI portal
Cites work
- A counterexample to the rank-coloring conjecture
- Advancing mathematics by guiding human intuition with AI
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- Automated conjecturing. II: Chomp and reasoned game play
- Automated conjecturing. III. Property-relations conjectures
- Automatic conjecturing and proving of exact values of some infinite families of infinite continued fractions
- Average distance and maximum induced forest
- Facet defining inequalities among graph invariants: The system graphedron
- Graphs of extremal weights
- Heuristic Problem Solving: The Next Advance in Operations Research
- scientific article; zbMATH DE number 1618181 (Why is no real title available?)
- scientific article; zbMATH DE number 5909822 (Why is no real title available?)
- scientific article; zbMATH DE number 4173028 (Why is no real title available?)
- scientific article; zbMATH DE number 4173029 (Why is no real title available?)
- scientific article; zbMATH DE number 4191740 (Why is no real title available?)
- scientific article; zbMATH DE number 4041962 (Why is no real title available?)
- scientific article; zbMATH DE number 1264487 (Why is no real title available?)
- scientific article; zbMATH DE number 1308947 (Why is no real title available?)
- scientific article; zbMATH DE number 1151813 (Why is no real title available?)
- scientific article; zbMATH DE number 2010142 (Why is no real title available?)
- scientific article; zbMATH DE number 5807 (Why is no real title available?)
- scientific article; zbMATH DE number 786171 (Why is no real title available?)
- scientific article; zbMATH DE number 861421 (Why is no real title available?)
- scientific article; zbMATH DE number 2188620 (Why is no real title available?)
- scientific article; zbMATH DE number 5037209 (Why is no real title available?)
- Independence and average distance in graphs
- Independence and the Havel-Hakimi residue
- k-Independence and thek-residue of a graph
- Matrix rank and communication complexity
- New results relating independence and matchings
- On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs
- On conjectures of Graffiti
- On one of Graffiti's conjectures (583)
- On some conjectures of Graffiti
- On the inequality between radius and Randić index for graphs
- On the representation and characterization of fullerene C\(_{60}\)
- On the residue of a graph
- On the two conjectures of Graffiti
- Parallelizing the dual revised simplex method
- Proving theorems by pattern recognition I
- Solution of the Robbins problem
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Spectral properties of fullerene graphs
- The annihilation number does not bound the 2-domination number from the above
- The average distance and the independence number
- Total forcing versus total domination in cubic graphs
- Using minimum degree to bound average distance
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures
- Zero forcing in claw-free cubic graphs
- Zero forcing parameters and minimum rank problems
- Zero forcing sets and the minimum rank of graphs
- Zero forcing versus domination in cubic graphs
This page was built for publication: Automated conjecturing with TxGraffiti
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7355845)
