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
Topic
Advanced Graph Theory Research
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.

2,515 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.
2,515 works in the cohort · of 4,299,418page 16 of 51

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

afffundunlabeled
Adjoint functors and tree duality
Jan Foniok, Claude Tardif
2009· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
7
citations
afffundunlabeled
Strongly Even‐Cycle Decomposable Graphs
Tony Huynh, Andrew D. King, Sang‐il Oum, Maryam Verdian-Rizi
2016· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Edge-colouring graphs with local list sizes
Marthe Bonamy, Michelle Delcourt, Richard Lang, Luke Postle
2023· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundunlabeled
P_4-Colorings and P_4-Bipartite Graphs
Chı́nh T. Hoàng, Van Bang Lê
2001· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+stsconsensus · none
7
citations
afffundunlabeled
Separating layered treewidth and row treewidth
Prosenjit Bose, Vida Dujmović, Mehrnoosh Javarsineh, Pat Morin, David R. Wood
2022· article· en· Discrete Mathematics & Theoretical Computer Science· Computer Science
distilled prediction:candidate · metaepi_narrow+stsconsensus · sts
7
citations
affunlabeled
Eternal domination on 3 × n grid graphs
Stephen Finbow, Margaret-Ellen Messinger, Martin F. van Bommel
2015· article· en· Australas. J Comb.· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
Distance-two colourings of Barnette graphs
Tomás Feder, Pavol Hell, Carlos Subi
2020· article· en· European Journal of Combinatorics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Skew partitions in perfect graphs
Bruce Reed
2007· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
The genus of Petersen powers
Bojan Mohar, Andrej Vodopivec
2010· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
On Graph Powers for Leaf-Labeled Trees
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
2000· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
7
citations
affno abstractunlabeled
Homomorphisms to powers of digraphs
Richard C. Brewster, Pavol Hell
2002· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
On homomorphisms to edge-coloured cycles
Richard C. Brewster, Pavol Hell
2000· article· en· Electronic Notes in Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affunlabeled
Counting 5‐connected planar triangulations
Zhicheng J. Gao, Ian M. Wanless, Nicholas Wormald
2001· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Planar graph bipartization in linear time
Samuel Fiorini, Nadia Hardy, Bruce Reed, Adrian Vetta
2005· article· en· Electronic Notes in Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
A short proof of non-GF(5)-representability of matroids
Jim Geelen, James Oxley, Dirk Vertigan, Geoff Whittle
2004· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
afffundno abstractunlabeled
New results on edge partitions of 1-plane graphs
Emilio Di Giacomo, Walter Didimo, William Evans, Giuseppe Liotta, Henk Meijer, Fabrizio Montecchiani +1 more
2017· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · sts+open_scienceconsensus · 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
affno abstractunlabeled
Matrix partitions of split graphs
Tomás Feder, Pavol Hell, Oren Shklarsky
2013· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
venueno affunlabeled
Boundary powerful k-alliances in graphs.
Ismael G. Yero, Juan A. Rodríguez‐Velázquez
2013· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · insufficient_payloadconsensus · none
7
citations
affno abstractunlabeled
Adaptive Multicolouring
Jeannette Janssen, K. Kilakos
2000· article· en· COMBINATORICA· Computer Science
distilled prediction:candidate · noneconsensus · none
7
citations
affno abstractunlabeled
Deeply asymmetric planar graphs
V. A. Aksionov, O. V. Borodin, Leonid S. Mel’nikov, Gert Sabidussi, Michael Stiebitz, Bjarne Toft
2005· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
6
citations
← previousnext →

How this was built: Screen · Findings · About