Pages that link to "Item:Q3522831"
From MaRDI portal
The following pages link to What is the furthest graph from a hereditary property? (Q3522831):
Displayed 15 items.
- The edit distance function and symmetrization (Q396842) (← links)
- On the computation of edit distance functions (Q472982) (← links)
- Testing properties of graphs and functions (Q607829) (← links)
- The structure of hereditary properties and 2-coloured multigraphs (Q653987) (← links)
- The maximum edit distance from hereditary graph properties (Q933672) (← links)
- Hardness of edge-modification problems (Q1034612) (← links)
- Accumulation points of the edit distance function (Q2138953) (← links)
- The edit distance function of some graphs (Q2175239) (← links)
- On the edit distance of powers of cycles (Q2317648) (← links)
- On the Edit Distance from K2,t-Free Graphs (Q2922222) (← links)
- Partitioning a Graph into Highly Connected Subgraphs (Q3188667) (← links)
- Edit distance measure for graphs (Q3466188) (← links)
- Stability‐type results for hereditary properties (Q3652542) (← links)
- On the edit distance function of the random graph (Q5886325) (← links)
- Largest subgraph from a hereditary property in a random graph (Q6098071) (← links)