On conjectures of Graffiti
From MaRDI portal
Publication:922723
DOI10.1016/0012-365X(88)90199-9zbMath0711.68081WikidataQ105709360 ScholiaQ105709360MaRDI QIDQ922723
Publication date: 1988
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (40)
Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs ⋮ Computing the bipartite edge frustration of fullerene graphs ⋮ Unnamed Item ⋮ A computational attack on the conjectures of Graffiti: New counterexamples and proofs ⋮ Inverse sum indeg reciprocal status index and co-index of graphs ⋮ Around the log-rank conjecture ⋮ General Randić indices of a graph and its line graph ⋮ Some tight bounds for the harmonic index and the variation of the Randić index of graphs ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ Randić index and the diameter of a graph ⋮ Discovering theorems in game theory: two-person games with unique pure Nash equilibrium payoffs ⋮ Mathematical applications of inductive logic programming ⋮ Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures ⋮ Matrix rank and communication complexity ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Automated conjecture making in number theory using HR, Otter and Maple ⋮ Linear inequalities among graph invariants: Using GraPHedron to uncover optimal relationships ⋮ Leapfrog fullerenes have many perfect matchings ⋮ Facet defining inequalities among graph invariants: The system graphedron ⋮ Beyond the Zagreb indices ⋮ Some eigenvalue properties in graphs (conjectures of Graffiti -- II) ⋮ Unnamed Item ⋮ Variable neighborhood search: Principles and applications ⋮ The asymptotic value of the Randić index for trees ⋮ On a relation between the Randić index and the chromatic number ⋮ Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille ⋮ The Randić index and the diameter of graphs ⋮ Automated generation of conjectures on forbidden subgraph characterization ⋮ Using stable sets to bound the chromatic number ⋮ A Graph Theoretic Formula for the Number of Primes $\pi(n)$ ⋮ On a conjecture of the Randić index ⋮ On the Randić index of graphs ⋮ On atom-bond connectivity index of graphs ⋮ An Additive Combinatorics Approach Relating Rank to Communication Complexity ⋮ A lower bound on the independence number of a graph ⋮ Computers and discovery in algebraic graph theory ⋮ The relation of matching with inverse degree of a graph ⋮ AutoGraphiX: a survey ⋮ Principles of human-computer collaboration for knowledge discovery in science ⋮ Independence and the Havel-Hakimi residue
Uses Software
This page was built for publication: On conjectures of Graffiti
