The following pages link to On conjectures of Graffiti (Q922723):
Displaying 40 items.
- Discovering theorems in game theory: two-person games with unique pure Nash equilibrium payoffs (Q420790) (← links)
- The asymptotic value of the Randić index for trees (Q550268) (← links)
- Randić index and the diameter of a graph (Q627931) (← links)
- \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II) (Q686466) (← links)
- On a relation between the Randić index and the chromatic number (Q708405) (← links)
- Automated generation of conjectures on forbidden subgraph characterization (Q741737) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- Leapfrog fullerenes have many perfect matchings (Q937674) (← links)
- Facet defining inequalities among graph invariants: The system graphedron (Q944740) (← links)
- Using stable sets to bound the chromatic number (Q1014408) (← links)
- On a conjecture of the Randić index (Q1026136) (← links)
- Independence and the Havel-Hakimi residue (Q1322229) (← links)
- Variable neighborhood search for extremal graphs. V: Three ways to automate finding conjectures (Q1422414) (← links)
- A lower bound on the independence number of a graph (Q1584341) (← links)
- Principles of human-computer collaboration for knowledge discovery in science (Q1606346) (← links)
- Computers and discovery in algebraic graph theory (Q1855400) (← links)
- A computational attack on the conjectures of Graffiti: New counterexamples and proofs (Q1910505) (← links)
- Matrix rank and communication complexity (Q1970502) (← links)
- The Randić index and the diameter of graphs (Q2275365) (← links)
- On the Randić index of graphs (Q2317645) (← links)
- On atom-bond connectivity index of graphs (Q2320125) (← links)
- Automated conjectures on upper bounds for the largest Laplacian eigenvalue of graphs (Q2369038) (← links)
- Computing the bipartite edge frustration of fullerene graphs (Q2370428) (← links)
- Some tight bounds for the harmonic index and the variation of the Randić index of graphs (Q2421872) (← links)
- Mathematical applications of inductive logic programming (Q2433178) (← links)
- Automated conjecture making in number theory using HR, Otter and Maple (Q2456561) (← links)
- The relation of matching with inverse degree of a graph (Q2581633) (← links)
- AutoGraphiX: a survey (Q3439391) (← links)
- Linear inequalities among graph invariants: Using <i>GraPHedron</i> to uncover optimal relationships (Q3548730) (← links)
- (Q5070067) (← links)
- A Graph Theoretic Formula for the Number of Primes $\pi(n)$ (Q5148772) (← links)
- Beyond the Zagreb indices (Q5154564) (← links)
- (Q5210568) (← links)
- Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille (Q5439393) (← links)
- An Additive Combinatorics Approach Relating Rank to Communication Complexity (Q5501927) (← links)
- Variable neighborhood search: Principles and applications (Q5937708) (← links)
- Inverse sum indeg reciprocal status index and co-index of graphs (Q6044419) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
- General Randić indices of a graph and its line graph (Q6083259) (← links)
