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
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 10 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.

venueno affunlabeled
Clique graphs of Helly circular arc graphs.
Guillermo Durán, Min Chih Lin
2001· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Proximity, remoteness and girth in graphs
Mustapha Aouchiche, Pierre Hansen
2017· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Twins of rayless graphs
Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel
2010· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
15
citations
affno abstractunlabeled
Finding houses and holes in graphs
Chı́nh T. Hoàng, R. Sritharan
2001· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
15
citations
affno abstractunlabeled
Ordering without Forbidden Patterns
Pavol Hell, Bojan Mohar, Arash Rafiey
2014· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrow+open_scienceconsensus · none
15
citations
affno abstractunlabeled
Elimination Graphs
Yuli Ye, Allan Borodin
2009· book-chapter· en· Lecture notes in computer science· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
14
citations
venueno affunlabeled
Square-free colorings of graphs.
Boštjan Brešar, Sandi Klavžar
2004· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affunlabeled
On the Polarity and Monopolarity of Graphs
Ross Churchley, Jing Huang
2013· article· en· Journal of Graph Theory· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
venueno affunlabeled
Broadcast domination of products of graphs.
Boštjan Brešar, Simon Špacapan
2009· article· en· Ars Combinatoria· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Treewidth of graphs with balanced separations
Zdenĕk Dvořák, Sergey Norin
2018· preprint· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · metaepi_narrowconsensus · none
14
citations
afffundno abstractunlabeled
Finite Sholander trees, trees, and their betweenness
Vašek Chvátal, Dieter Rautenbach, Philipp Matthias Schäfer
2011· article· en· Discrete Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affunlabeled
Solving a "Hard" problem to approximate an "Easy" one
Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze
2002· article· en· ACM Journal of Experimental Algorithmics· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Generating weakly 4-connected matroids
Jim Geelen, Xiangqian Zhou
2007· article· en· Journal of Combinatorial Theory Series B· Computer Science
distilled prediction:candidate · noneconsensus · none
14
citations
affno abstractunlabeled
Maximum fractional factors in graphs
Guizhen Liu, Qinglin Yu, Lanju Zhang
2007· article· en· Applied Mathematics Letters· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
afffundno abstractunlabeled
Partitioned probe comparability graphs
David B. Chandler, Maw‐Shang Chang, Ton Kloks, Jiping Liu, Sheng‐Lung Peng
2008· article· en· Theoretical Computer Science· Computer Science
distilled prediction:candidate · stsconsensus · none
13
citations
affno abstractunlabeled
Packing trees in communication networks
Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Zhang Hu
2008· article· en· Journal of Combinatorial Optimization· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
afffundunlabeled
5-List-Coloring Planar Graphs with Distant Precolored Vertices
Zdenĕk Dvořák, Bernard Lidický, Bojan Mohar, Luke Postle
2017· article· en· Iowa State University Digital Repository (Iowa State University)· Computer Science
distilled prediction:candidate · metaepi_narrow+sts+scholarly_communicationconsensus · none
13
citations
affno abstractunlabeled
On well-covered triangulations: Part II
Arthur S. Finbow, Bert L. Hartnell, Richard J. Nowakowski, Michael D. Plummer
2009· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
Efficient algorithms for finding critical subgraphs
Christian Desrosiers, P. Galinier, Alain Hertz
2007· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations
affno abstractunlabeled
The vertex leafage of chordal graphs
Steven Chaplick, Juraj Stacho
2012· article· en· Discrete Applied Mathematics· Computer Science
distilled prediction:candidate · noneconsensus · none
13
citations

How this was built: Screen · Findings · About