Edge clique covering sum of graphs (Q1701317): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Covering graphs by the minimum number of equivalence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decomposition of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3312268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise balanced designs and sigma clique partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Representation of a Graph by Set Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a graph by complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of G. O. H. Katona and T. Tarján / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique partitions of the cocktail party graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a clique covering problem of Orlin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Clique Covering of Claw-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Katona and Tarjan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biclique covers and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal clique partitions and pairwise balanced designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3487359 / rank
 
Normal rank

Latest revision as of 05:51, 15 July 2024

scientific article
Language Label Description Also known as
English
Edge clique covering sum of graphs
scientific article

    Statements

    Edge clique covering sum of graphs (English)
    0 references
    0 references
    0 references
    0 references
    22 February 2018
    0 references
    0 references
    edge clique covering
    0 references
    edge clique partition
    0 references
    edge clique cover sum number
    0 references
    edge clique partition sum number
    0 references
    set intersection representation
    0 references
    set system
    0 references
    0 references