| Graph algebra | 7Y8BK73104 | definition | open | Wikipedia Graph algebra (social sciences), Wikidata Q5597071 |
| Graph algebra | RGB3D3XX2D | definition | open | Wikipedia Graph algebra, Wikidata Q5597072 |
| Graph amalgamation | AMPQZ0D70M | definition | open | Wikipedia Graph amalgamation, Wikidata Q18207512 |
| graph automorphism | PCCMKVQV39 | definition | open | Wikidata Q834981, MathWorld GraphAutomorphism, Wikipedia Graph automorphism |
| Graph automorphism problem | ZTZ8C75ERR | unknown | open | Wikipedia Graph automorphism#Q5LP |
| Graph bandwidth | ETXY9TJ63M | definition | open | Wikipedia Graph bandwidth, Wikidata Q5597073 |
| Graph C*-algebra | 51QJWN1QEH | definition | open | Wikipedia Graph C*-algebra, Wikidata Q25303886 |
| graph canonization | GVEH2RVX9N | definition | open | Wikidata Q5597079, MathWorld CanonicalLabeling, Wikipedia Graph canonization |
| Graph canonization | HXNKS4Y046 | definition | open | Wikipedia List of unsolved problems in computer science#YEQF |
| Graph center | D71RVH4Z4E | definition | open | Wikipedia Graph center, Wikidata Q5597075 |
| Graph Coarsening Algorithm | A2XP2043TN | definition | open | Wikipedia Graph Coarsening Algorithm, Wikidata Q136206072 |
| Graph coloring | 1KTV4APDGE | definition | open | Wikipedia List of NP-complete problems#YFNS |
| graph coloring | 6ENJQBG74Z | statement | node (a node has the same Wikidata item as the row) | mathlib_1000 Q504843, Wikidata Q504843, thousand_plus Q504843, Wikipedia Mycielski's theorem, MathWorld GraphColoring, Wikipedia Graph coloring |
| Graph coloring game | 5EMNE6ESDS | definition | open | Wikipedia Graph coloring game, Wikidata Q18207514 |
| Graph coloring game | 6NQ5Y9G6D4 | definition | open | Wikipedia List of PSPACE-complete problems#EKX1 |
| graph connectivity measure | J9HMRP3CMS | definition | open | Wikidata Q72897900, EoM Graph,_connectivity_of_a, Wikipedia Connectivity (graph theory) |
| Graph continuous function | ACYN8XVKR6 | definition | open | Wikipedia Graph continuous function, Wikidata Q5597077 |
| Graph counting lemma | 52DBRXS46Y | statement | record (an item of a paper that no node asks for yet. The record keeps its edges in the record plane (corpus arxiv AX8.6)) | arXiv 2609.38772#UBTM |
| Graph counting lemma | 5JQXFJC0K9 | statement | open | Wikipedia Graph removal lemma#XUPE |
| Graph counting lemma | MV1PPVDJ1E | statement | open | Wikipedia Szemerédi regularity lemma#IZTN |
| Graph cut optimization | HZ80Q3SVXK | definition | open | Wikipedia Graph cut optimization, Wikidata Q60321144 |
| Graph cuts in computer vision | YS7SGAX93E | definition | open | Wikipedia List of statistics articles#1VPM |
| Graph cuts in computer vision and artificial intelligence | GG1M9AZBJE | definition | open | Wikipedia Graph cuts in computer vision and artificial intelligence, Wikidata Q3774432 |
| graph diameter | V2T328V7SJ | definition | open | Wikidata Q16628701, MathWorld GraphDiameter, Wikipedia Diameter (graph theory) |
| graph dimension | FAEW3E6MK5 | definition | open | Wikidata Q13415176, MathWorld GraphDimension, Wikipedia Dimension (graph theory) |
| graph distance | RPC09MC22X | definition | node (a node has the same Wikidata item as the row) | Wikidata Q2742711, MathWorld GraphDistance, Wikipedia Distance (graph theory) |
| Graph divergence | ZGEC6TVP5C | unknown | open | Wikipedia Calculus on finite weighted graphs#CSZX |
| Graph drawing | A1E7AFT4J7 | definition | open | Wikipedia List of computer graphics and descriptive geometry topics#5U4B |
| Graph drawing | KXW0CZBE32 | definition | open | Wikipedia Graph drawing, Wikidata Q739462 |
| Graph drawing algorithms | PR8H85MMSN | definition | open | Wikipedia Graph drawing#JA7H |
| Graph drawing software | 1KKFCHQE63 | unknown | open | Wikipedia Graph drawing#QDRI |
| Graph dynamical system | A1ZTX1GS6G | definition | open | Wikipedia List of dynamical systems and differential equations topics#FS13 |
| Graph dynamical system | RWH39FB8SV | definition | open | Wikipedia Graph dynamical system, Wikidata Q5597080 |
| graph eccentricity | YVH0S9H4SF | unknown | open | Wikidata Q65556262, MathWorld GraphEccentricity |
| Graph edit distance | TXEK4B3D89 | definition | open | Wikipedia Graph edit distance, Wikidata Q25304679 |
| graph embedding | TV6KNZ6H42 | definition | open | Wikidata Q5597085, MathWorld GraphEmbedding, Wikipedia Graph embedding |
| Graph embedding version of counting lemma | HMH08DRJSK | statement | open | Wikipedia Counting lemma#B80L |
| Graph energy | R5DHW4255F | definition | open | Wikipedia Graph energy, Wikidata Q5597087 |
| Graph entropy | 32M0MBD25N | definition | open | Wikipedia Graph entropy, Wikidata Q28404824 |
| Graph enumeration | DSXJGG7E0K | definition | open | Wikipedia Graph enumeration, Wikidata Q5597086 |
| Graph equation | 58S0X57C7K | definition | open | Wikipedia Graph equation, Wikidata Q5597082 |
| Graph exploration algorithm | J6FW40GFKW | definition | open | Wikipedia List of graph theory topics#MYH4, Wikipedia List of algorithm general topics#U5Y5 |
| Graph factorization | SKFE310SWN | definition | open | Wikipedia Graph factorization, Wikidata Q5597083 |
| Graph flattenability | 7AE1E7XBSF | definition | open | Wikipedia Graph flattenability, Wikidata Q111955002 |
| Graph Fourier transform | RRFSEHQM0G | definition | open | Wikipedia Graph Fourier transform, Wikidata Q97354474 |
| Graph generation | 5WJJ7K21JR | statement | record (an item of a paper that no node asks for yet. The record keeps its edges in the record plane (corpus arxiv AX8.6)) | arXiv 2609.39700#2L0F |
| Graph homology | 2K76M76QHZ | definition | open | Wikipedia Graph homology, Wikidata Q97933188 |
| Graph homomorphism | 2JFXXNJF8V | definition | open | Wikipedia List of NP-complete problems#6QGR |
| graph homomorphism | CQTGZEFK2A | definition | node (a node has the same name as the row) | Wikidata Q3385162, MathWorld StructureHomomorphism, ProofWiki Definition:Homomorphism_(Graph_Theory), Wikipedia Graph homomorphism |
| Graph intersection number | ZXXXSJJZPP | definition | open | Wikipedia List of NP-complete problems#5DVG |
| graph isomorphism | TM6EG3W21W | definition | node (a node has the same name as the row) | Wikidata Q303100, MathWorld GraphIsomorphism, Wikipedia Graph isomorphism |
| Graph isomorphism problem | GRZFCG0FD8 | conjecture | open | Wikipedia List of unsolved problems in computer science#J0BE |
| Graph isomorphism problem | WFT8Y17WR2 | conjecture | open | Wikipedia Graph isomorphism problem, Wikidata Q3738036 |
| graph join | K2ADTWAZ58 | definition | open | Wikidata Q136480145, MathWorld GraphJoin, Wikipedia Join (graph theory) |
| Graph labeling | XHYVP64BFR | definition | open | Wikipedia Graph labeling, Wikidata Q5597093 |
| Graph literacy | K03FYBMXMD | definition | open | Wikipedia Graph literacy, Wikidata Q17091083 |
| Graph manifold | PESBS1B6GP | definition | open | Wikipedia Graph manifold, Wikidata Q4148033 |
| Graph matching | AQANWMEJAX | definition | open | Wikipedia Graph matching, Wikidata Q39045684 |
| Graph Modelling Language | ZNPT4NZC1V | definition | open | Wikipedia Graph Modelling Language, Wikidata Q1543319 |
| Graph morphism (algebraic geometry) | 4Z3YA7CVVG | unknown | open | Wikipedia Morphism of schemes#V191 |
| Graph of a bivariate function | QAPYYVNQ8J | unknown | open | Wikipedia Graph of a function#9QEX |
| Graph of a function | 4Q5HRGMRNS | definition | open | Wikipedia List of graphical methods#6T0J |
| Graph of a function | CQMS9AP34V | definition | open | Wikipedia List of mathematical abbreviations#65B7 |
| Graph of a function | KNZ5Z6YXJW | definition | open | open_logic content/sets-functions-relations/functions/functions-relations.tex#defn-1 |
| graph of a function | M5WM4C5JBZ | definition | node (a node has the same name as the row) | Wikidata Q182598, MathWorld FunctionGraph, nLab graph of a function, Wikipedia Graph of a function |
| Graph of a partial function | 5V60FJBYEF | definition | open | open_logic content/sets-functions-relations/functions/partial-functions.tex#defn-2 |
| graph of groups | QQCFMG49QT | definition | open | Wikidata Q3115551, nLab graph of groups, Wikipedia Graph of groups |
| graph of pseudorhombicuboctahedron | HGHKQ3BSKF | unknown | open | Wikidata Q16640053, House of Graphs 52608 |
| Graph operations | B075VYENGG | definition | open | Wikipedia Graph operations, Wikidata Q1028355 |
| Graph paper | EFPBD4Z9NC | definition | open | Wikipedia Graph paper, Wikidata Q17310518 |
| Graph partition | E67ZM7GWNS | definition | open | Wikipedia List of partition topics#L0IA |
| Graph partition | RA44G5DPX8 | definition | open | Wikipedia List of NP-complete problems#PBJQ |
| Graph partition | S2A2VYAX39 | definition | open | Wikipedia Graph partition, Wikidata Q491370 |
| Graph partition methods | HMRNKS7085 | definition | open | Wikipedia Graph partition#W43H |
| Graph pebbling | 9W5XBTAW7X | definition | open | Wikipedia Graph pebbling, Wikidata Q5597090 |
| Graph polynomial | WV8NE02EV2 | definition | open | Wikipedia Graph polynomial, Wikidata Q48999599 |
| graph power | CXXDTBCNNB | definition | open | Wikidata Q5597091, MathWorld GraphPower, Wikipedia Graph power |
| graph product | Q3GR0B7PH3 | definition | open | Wikidata Q569347, MathWorld GraphProduct, nLab graph product, Wikipedia Graph product |
| Graph property | C9NA65947N | definition | open | Wikipedia Graph property, Wikidata Q722659 |
| graph radius | VM1G3SX2WE | unknown | open | Wikidata Q30765484, MathWorld GraphRadius |
| Graph realization problem | 93P7F0HEZ9 | problem | open | Wikipedia Graph realization problem, Wikidata Q18207520 |
| Graph recursion $\RR$ | 6BCRYJ629A | definition | record (an item of a paper that no node asks for yet. The record keeps its edges in the record plane (corpus arxiv AX8.6)) | arXiv 2609.35102#O5BX |
| Graph reduction | EVE9E421X4 | definition | open | Wikipedia Graph reduction, Wikidata Q5597097 |
| Graph refinement | E2S97D03DE | statement | record (an item of a paper that no node asks for yet. The record keeps its edges in the record plane (corpus arxiv AX8.6)) | arXiv 2610.09295#0KD8 |
| Graph removal lemma | 797W50ZY0R | statement | open | Wikipedia Graph removal lemma, Wikidata Q62931187 |
| Graph rewriting | FJ8XM68SDH | definition | open | Wikipedia Graph rewriting, Wikidata Q1508564 |
| Graph sandwich problem | JVXJQGPPN6 | problem | open | Wikipedia Graph sandwich problem, Wikidata Q5597096 |
| Graph skewness | FCBMTPPXA3 | unknown | open | Wikipedia Planarization#PXXQ |
| graph spectrum | RPK28PQHFC | unknown | open | Wikidata Q130529047, MathWorld GraphSpectrum |
| Graph structure theorem | 1V8QG78CGQ | statement | open | Wikipedia List of theorems#BH1T |
| Graph structure theorem | DRPETTZF6A | statement | open | mathlib_1000 Q5597098, Wikidata Q5597098, thousand_plus Q5597098, Wikipedia Graph structure theorem |
| graph theory | FRGGTR4ECY | topic | open | Wikidata Q131476, MathWorld GraphTheory, ProofWiki Definition:Graph_Theory, Wikipedia Graph theory |
| Graph theory | P6KHN1KYKX | definition | open | Wikipedia Glossary of areas of mathematics#GN6L |
| Graph theory | QH1HEPYM34 | topic | open | Wikipedia List of steganography techniques#XPYH |
| Graph Theory, 1736–1936 | PWCX0YZ104 | definition | open | Wikipedia Graph Theory, 1736–1936, Wikidata Q98113934 |
| Graph toughness | GRP0V9E1X2 | definition | open | Wikipedia Graph toughness, Wikidata Q5597099 |
| Graph Transition Kernel | CHX0PKZ6CZ | definition | record (an item of a paper that no node asks for yet. The record keeps its edges in the record plane (corpus arxiv AX8.6)) | arXiv 2609.36421#WXKM |
| Graph traversal | 5SECJNG973 | definition | open | Wikipedia Graph traversal, Wikidata Q907955 |
| Graph traversal algorithms | W7161Y7MHK | definition | open | Wikipedia Graph traversal#RYI7 |
| Graph unification | PR5VW516RZ | unknown | open | Wikipedia Graph theory#4GNC |