The edit distance function of some graphs

DOI10.7151/dmgt.2154zbMath1439.05116arXiv1707.07170OpenAlexW2963359962WikidataQ129228409 ScholiaQ129228409MaRDI QIDQ2175239

Yongtang Shi, Yarong Wei, Yumei Hu

Publication date: 28 April 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.07170

zbMATH Keywords

hereditary propertyedit distancecolored regularity graphsclique spectrum

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The edit distance function and symmetrization
• On the computation of edit distance functions
• Edit distance and its computation
• On the edit distance of powers of cycles
• On the Edit Distance from K2,t-Free Graphs
• The edit distance in graphs: Methods, results, and generalizations
• On the editing distance of graphs
• What is the furthest graph from a hereditary property?
• The Algorithmic Aspects of the Regularity Lemma
• Testing subgraphs in large graphs
• Efficient testing of large graphs

This page was built for publication: The edit distance function of some graphs