MétaCan
ENFR
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.

Export CSVExport JSONAPI query

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
Graphs and Combinatorics
Topic
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.

139 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.
139 works in the cohort · of 4,299,418page 1 of 3

Labels cover 0 of 139 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 139 of 139 works in this cohort. Predictions are machine_predicted_unvalidated teacher distillation outputs. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
The k-Dominating Graph
Ruth Haas, Karen Seyffarth
2013· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
On the Roots of Domination Polynomials
Jason I. Brown, Julia Tufts
2013· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
43
citations
affno abstractunlabeled
Shattering News
R.P. Anstee, Lajos Rónyai, Attila Sali
2002· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
42
citations
affno abstractunlabeled
A Note on Cycle Lengths in Graphs
R.J. Gould, Penny Haxell, Alex Scott
2002· article· en· Graphs and Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
27
citations
affno abstractunlabeled
Zero-Sum Flows in Regular Graphs
Saieed Akbari, Akbar Daemi, O. Hatami, Adel Javanmard, Abbas Mehrabian
2010· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
Efficient Many-To-Many Point Matching in One Dimension
Justin Colannino, Mirela Damian, Ferrán Hurtado, Stefan Langerman, Henk Meijer, Suneeta Ramaswami +2 more
2007· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
25
citations
affno abstractunlabeled
The Crossing Number of P(N, 3)
R. Bruce Richter, Gelasio Salazar
2002· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
24
citations
affno abstractunlabeled
Diagonal Flips in Labelled Planar Triangulations
Zhicheng Gao, Jorge Urrutia, Jianyu Wang
2001· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
19
citations
affno abstractunlabeled
Upper Bounds for α-Domination Parameters
Andrei Gagarin, Anush Poghosyan, Vadim Zverovich
2009· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
16
citations
affno abstractunlabeled
Hadwiger Number and the Cartesian Product of Graphs
L. Sunil Chandran, Alexandr Kostochka, J. Krishnam Raju
2008· article· en· Graphs and Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Cleaning with Brooms
Margaret-Ellen Messinger, Richard J. Nowakowski, Paweł Prałat
2010· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Fast Winning Strategies in Avoider-Enforcer Games
Dan Hefetz, Michael Krivelevich, Miloš Stojaković, Tibor Szabó
2009· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
On a Decomposition of Complete Graphs
Hadi Kharaghani, R. Torabi
2003· article· en· Graphs and Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
10
citations
affno abstractunlabeled
Paired Domination Vertex Critical Graphs
Xinmin Hou, Michelle Edwards
2008· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
10
citations
afffundno abstractunlabeled
On the Unimodality of Domination Polynomials
Iain Beaton, Jason I. Brown
2022· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Burning the Plane
Anthony Bonato, Karen Gunderson, Amy Shaw
2020· article· en· Graphs and Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
9
citations
affno abstractunlabeled
Symmetric Graph Designs
H. -D. O. F. Gronau, R. C. Mullin, A. Rosa, P. J. Schellenberg
2000· article· en· Graphs and Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
8
citations
affno abstractunlabeled
Enumerating Non-crossing Minimally Rigid Frameworks
David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin‐ichi Tanigawa
2007· article· en· Graphs and Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Spanning Trails Connecting Given Edges
Hong‐Jian Lai, Xiangwen Li, Hoifung Poon, Yongbin Ou
2005· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
From One to Many Rainbow Hamiltonian Cycles
Peter Bradshaw, Kevin Halasz, Ladislav Stacho
2022· article· en· Graphs and Combinatorics· Mathematics
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
On Well-Covered Cartesian Products
Bert L. Hartnell, Douglas F. Rall, Kirsti Wash
2018· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Paired-Domination in Claw-Free Graphs
Shenwei Huang, Liying Kang, Erfang Shan
2012· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Silver Cubes
M. Ghebleh, Luis Goddyn, E. S. Mahmoodian, Maryam Verdian-Rizi
2008· article· en· Graphs and Combinatorics· Engineering
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Graphical Representations of Graphic Frame Matroids
Rong Chen, Matthew DeVos, Daryl Funk, Irene Pivotto
2015· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
affno abstractunlabeled
Algorithmic Folding Complexity
Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi +3 more
2011· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
fundno affno abstractunlabeled
König–Egerváry Graphs are Non-Edmonds
P. Mark Kayll
2010· article· en· Graphs and Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
next →

How this was built: Screen · Findings · About