The following pages link to AutoGraphiX: a survey (Q3439391):
Displaying 18 items.
- AutoGraphiX (Q18271) (← links)
- On the further relation between the (revised) Szeged index and the Wiener index of graphs (Q277640) (← links)
- Using size for bounding expressions of graph invariants (Q646725) (← links)
- Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond (Q729760) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number (Q955318) (← links)
- A survey of automated conjectures in spectral graph theory (Q962119) (← links)
- Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance (Q967410) (← links)
- A sharp upper bound on algebraic connectivity using domination number (Q967504) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Nordhaus-Gaddum relations for proximity and remoteness in graphs (Q988253) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number (Q1043938) (← links)
- Automated conjecturing. III. Property-relations conjectures (Q1688717) (← links)
- Edge-grafting transformations on the average eccentricity of graphs and their applications (Q1701119) (← links)
- Upper bounds on the average eccentricity (Q2440101) (← links)
- The (revised) Szeged index and the Wiener index of a nonbipartite graph (Q2441630) (← links)
- The average eccentricity of a graph with prescribed girth (Q2675826) (← links)
