Combinatorial designs related to the strong perfect graph conjecture (Q1255951): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q123268227 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial designs and related systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strong perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of balanced bipartite designs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolvable balanced bipartite designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect zero–one matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical perfect graphs and perfect 3-chromatic graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:49, 13 June 2024

scientific article
Language Label Description Also known as
English
Combinatorial designs related to the strong perfect graph conjecture
scientific article

    Statements

    Combinatorial designs related to the strong perfect graph conjecture (English)
    0 references
    0 references
    1979
    0 references
    Combinatorial Designs
    0 references
    Strong Perfect Graph Conjecture
    0 references

    Identifiers