MétaCan
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
Sort
Language
Type
Field
Venue
Topic
Graph Labeling and Dimension Problems
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

807 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
807 works in the cohort · of 4,299,418page 1 of 17

Labels cover 1 of 807 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 807 of 807 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
A survey of Nordhaus–Gaddum type relations
Mustapha Aouchiche, Pierre Hansen
2012· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
203
citations
affno abstractunlabeled
Degree constrained subgraphs
Louigi Addario‐Berry, Ketan Dalal, Bruce A. Reed
2007· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
121
citations
affno abstractunlabeled
The metric dimension of Cayley digraphs
Melodie Fehr, Shonda Gosselin, Ortrud R. Oellermann
2006· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
118
citations
affno abstractunlabeled
Vertex-Colouring Edge-Weightings
Louigi Addario‐Berry, Colin McDiarmid, Bruce A. Reed, Andrew Thomason
2007· article· en· COMBINATORICA· Computer Science
machine prediction:candidate · noneconsensus · none
114
citations
affno abstractunlabeled
Vertex colouring edge partitions
Louigi Addario‐Berry, R. E. L. Aldred, Ketan Dalal, Bruce A. Reed
2005· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
109
citations
affno abstractunlabeled
Additive Combinatorics
Andrew Granville, Melvyn B. Nathanson
2007· book· en· CRM proceedings & lecture notes· Computer Science
machine prediction:candidate · noneconsensus · none
107
citations
fundno affunlabeled
On the Quantum Chromatic Number of a Graph
Peter J‎. Cameron, Ashley Montanaro, Michael Newman, Simone Severini, Andreas Winter
2007· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
100
citations
affno abstractunlabeled
On vertex-coloring 13-edge-weighting
Tao Wang, Qinglin Yu
2008· article· en· Frontiers of Mathematics in China· Computer Science
machine prediction:candidate · noneconsensus · none
79
citations
aboutno affunlabeled
The Map-Coloring Game
Tomasz Bartnicki, Jarosław Grytczuk, H. A. Kierstead, Xuding Zhu
2007· article· en· American Mathematical Monthly· Computer Science
machine prediction:candidate · noneconsensus · none
72
citations
venueno affno abstractunlabeled
On Super Edge-Magic Graphs.
Ramón M. Figueroa-Centeno, Rikio Ichishima, Francesc A. Muntaner-Batle
2002· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
59
citations
afffundno abstractunlabeled
On the b-dominating coloring of graphs
Chı́nh T. Hoàng, Mekkia Kouider
2005· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
57
citations
fundno affunlabeled
On the metric dimension of Grassmann graphs
R. A. Bailey, Karen Meagher
2012· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
53
citations
affno abstractunlabeled
The partition dimension of Cayley digraphs
Melodie Fehr, Shonda Gosselin, Ortrud R. Oellermann
2006· article· en· Aequationes Mathematicae· Computer Science
machine prediction:candidate · noneconsensus · none
45
citations
venueno affno abstractunlabeled
A Note on Strongly Graceful Trees.
Bing Yao, Hui Cheng, Yao Ming, Meimei Zhao
2009· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
afffundunlabeled
Metric Dimension for Random Graphs
Béla Bollobás, Dieter Mitsche, Paweł Prałat
2013· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations
affno abstractunlabeled
Vertex-coloring 2-edge-weighting of graphs
Hongliang Lu, Qinglin Yu, Cun‐Quan Zhang
2010· article· en· European Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
37
citations
venueno affunlabeled
On the metric dimension of Mobius ladders
Murtaza Ali, Gohar Ali, Muhammad Imran, Abdul Qudair Baig, Muhammad Kashif Shafiq
2012· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
Chromatic Number and the 2-Rank of a Graph
Chris Godsil, Gordon Royle
2001· article· en· Journal of Combinatorial Theory Series B· Computer Science
machine prediction:candidate · noneconsensus · none
35
citations
affno abstractunlabeled
Labeling trees with a condition at distance two
Tiziana Calamoneri, Andrzej Pelc, Rossella Petreschi
2006· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
affno abstractunlabeled
Magic square spectra
P. D. Loly, Ian Cameron, Walter Trump, Daniel Schindel
2008· article· en· Linear Algebra and its Applications· Computer Science
machine prediction:candidate · noneconsensus · none
32
citations
afffundunlabeled
Adjacency Labelling for Planar Graphs (and Beyond)
Vida Dujmović, Louis Esperet, Cyril Gavoille, Gwenaël Joret, Piotr Micek, Pat Morin
2020· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
afffundno abstractunlabeled
Locating a robber on a graph
Suzanne M. Seager
2012· article· en· Discrete Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
31
citations
affunlabeled
L(2,1)-labelling of graphs
Frédéric Havet, Bruce Reed, Jean‐Sébastien Sereni
2008· article· en· HAL (Le Centre pour la Communication Scientifique Directe)· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
venueno affno abstractunlabeled
Metric-Locating-Dominating Sets in Graphs.
Michael A. Henning, Ortrud R. Oellermann
2004· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
30
citations
venueno affno abstractunlabeled
On vertex irregular total labelings.
Ali Ahmad, Martin Bača
2013· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
affunlabeled
Relaxed Graceful Labellings of Trees
Frank Van Bussel
2002· article· en· The Electronic Journal of Combinatorics· Computer Science
machine prediction:candidate · noneconsensus · none
28
citations
afffundno abstractunlabeled
The simultaneous metric dimension of graph families
Yunior Ramírez-Cruz, Ortrud R. Oellermann, Juan A. Rodríguez‐Velázquez
2015· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
venueno affunlabeled
Cubic Graphs with Application
Sheikh Rashid, Naveed Yaqoob, Muhammad Akram, Muhammad Gulistan
2018· article· en· International Journal of Analysis and Applications· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
affunlabeled
Gray code numbers for graphs
Kelly Choo, Gary MacGillivray
2011· article· en· Ars Mathematica Contemporanea· Computer Science
machine prediction:candidate · noneconsensus · none
27
citations
venueno affno abstractunlabeled
Vertex-distinguishing total coloring of graphs.
Zhang Zhong-fu, Pengxiang Qiu, Baogen Xu, Jingwen Li, Chen Xiang-en, Bing Yao
2008· article· en· Ars Combinatoria· Computer Science
machine prediction:candidate · noneconsensus · none
26
citations

How this was built: Screen · Findings · About