Packing triangles in \(K_4\)-free graphs (Q2014715): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRAPHS WITH SMALL INDEPENDENCE NUMBER MINIMIZING THE SPECTRAL RADIUS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of Rademacher-Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of complete subgraphs and circuits contained in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of triangles in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edge disjoint cliques in graphs of given size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flag algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Minimal Density of Triangles in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5781249 / rank
 
Normal rank

Latest revision as of 14:46, 8 July 2024

scientific article
Language Label Description Also known as
English
Packing triangles in \(K_4\)-free graphs
scientific article

    Statements

    Identifiers