On the Edit Distance from K2,t-Free Graphs (Q2922222): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: What is the furthest graph from a hereditary property? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the editing distance of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edit distance and its computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Dense Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphs that do not Contain a Thomsen Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saturation numbers of books / rank
 
Normal rank
Property / cites work
 
Property / cites work: Values of lambda and mu for which there are only finitely many feasible (v,k,lambda,mu) / rank
 
Normal rank
Property / cites work
 
Property / cites work: New asymptotics for bipartite Turán numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edit distance function and symmetrization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundedness of optimal matrices in extremal multigraph and digraph problems / rank
 
Normal rank

Latest revision as of 03:04, 9 July 2024

scientific article
Language Label Description Also known as
English
On the Edit Distance from K2,t-Free Graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references