Covering triangles in edge-weighted graphs (Q726109): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Packing Triangles in Weighted Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering triangles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conjecture on triangles of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Tuza about packing and covering of triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering triangles in tripartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering triangles in \(K_{4}\)-free planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering triangles in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tuza's Conjecture is Asymptotically Tight for Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Class of Totally Unimodular Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226075 / rank
 
Normal rank

Latest revision as of 06:43, 16 July 2024

scientific article
Language Label Description Also known as
English
Covering triangles in edge-weighted graphs
scientific article

    Statements

    Covering triangles in edge-weighted graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    3 August 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    triangle cover
    0 references
    triangle packing
    0 references
    linear 3-uniform hypergraphs
    0 references
    combinatorial algorithms
    0 references
    0 references