Pages that link to "Item:Q933672"

The following pages link to The maximum edit distance from hereditary graph properties (Q933672):

Displaying 22 items.

• The edit distance function and symmetrization (Q396842) (← links)
• On the computation of edit distance functions (Q472982) (← links)
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity (Q490983) (← links)
• Graph distance measures based on topological indices revisited (Q669403) (← links)
• Quantitative graph theory: a new branch of graph theory and network science (Q780939) (← links)
• Obstructions for partitioning into forests and outerplanar graphs (Q831856) (← links)
• Edit distance and its computation (Q1010726) (← links)
• Hardness of edge-modification problems (Q1034612) (← links)
• Estimating the distance to a hereditary graph property (Q1689980) (← links)
• Accumulation points of the edit distance function (Q2138953) (← links)
• \((k,l)\)-colourings and Ferrers diagram representations of cographs (Q2225413) (← links)
• A comparative analysis of new graph distance measures and graph edit distance (Q2293189) (← links)
• Deviation estimates for Eulerian edit numbers of random graphs (Q2658005) (← links)
• A note on the bichromatic numbers of graphs (Q3061187) (← links)
• Excluding induced subgraphs: Critical graphs (Q3068762) (← links)
• Edit distance measure for graphs (Q3466188) (← links)
• A Brooks‐Type Theorem for the Bichromatic Number (Q3466343) (← links)
• On the editing distance of graphs (Q3506314) (← links)
• What is the furthest graph from a hereditary property? (Q3522831) (← links)
• Stability‐type results for hereditary properties (Q3652542) (← links)
• On the edit distance function of the random graph (Q5886325) (← links)
• Graph distance measures based on Balaban indices (Q6560778) (← links)