Research problems from the 19th British Combinatorial Conference (Q1779507): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2005.02.006 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.02.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2917664358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of partial geometric designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings and paths in the cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4137196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block designs: a randomization approach. Vol. 2: Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4211751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of some two-associate-class partially balanced incomplete- block designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial designs with two singular values. II: Partial geometric designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration of cospectral graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite embedding theorems for partial Latin squares, quasi-groups, and loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding tight single-change covering designs with \(v=20, k=5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3408855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5676231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical hypergraphs and interesting set-pair systems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2005.02.006 / rank
 
Normal rank

Latest revision as of 11:04, 11 December 2024

scientific article
Language Label Description Also known as
English
Research problems from the 19th British Combinatorial Conference
scientific article

    Statements

    Identifiers