On the triangle clique cover and \(K_t\) clique cover problems (Q2279271): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2752765779 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1709.01590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex elimination orderings for hereditary graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the Turán number \(t_3(n,4)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / 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: The Complexity of Near-Optimal Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering edges by cliques with regard to keyword conflicts and intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covers in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5539649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5721211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of edge coverings by cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of a theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fractional intersection number of a graph / rank
 
Normal rank

Latest revision as of 06:42, 21 July 2024

scientific article
Language Label Description Also known as
English
On the triangle clique cover and \(K_t\) clique cover problems
scientific article

    Statements

    On the triangle clique cover and \(K_t\) clique cover problems (English)
    0 references
    0 references
    0 references
    0 references
    12 December 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    triangle clique cover
    0 references
    edge clique cover
    0 references
    Turan graph
    0 references
    intersection number
    0 references
    community detection
    0 references
    graph clustering
    0 references
    0 references
    0 references