Pages that link to "Item:Q1356416"
From MaRDI portal
The following pages link to Distances between graphs under edge operations (Q1356416):
Displaying 24 items.
- The graph distance game and some graph operations (Q283692) (← links)
- Approximating degree sequences with regular graphic sequences (extended abstract) (Q283722) (← links)
- The edge rotation graph (Q367068) (← links)
- A quadratic distance bound on sliding between crossing-free spanning trees (Q883234) (← links)
- Flips in planar graphs (Q950400) (← links)
- On the diameter of geometric path graphs of points in convex position (Q976134) (← links)
- Undirected distances and the postman-structure of graphs (Q1099186) (← links)
- Distances and volumina for graphs (Q1126939) (← links)
- Subgraph distances in graphs defined by edge transfers (Q1363654) (← links)
- Edge rotation and edge slide distance graphs (Q1388979) (← links)
- Degree-anonymization using edge rotations (Q2034394) (← links)
- Properties of graph distance measures by means of discrete inequalities (Q2295900) (← links)
- Graphic sequences, distances and \(k\)-degree anonymity (Q2345626) (← links)
- (Q3110081) (← links)
- Edge shift distance between trees (Q3138106) (← links)
- (Q3835505) (← links)
- Distance: A graphical tour (Q3976639) (← links)
- On distances between isomorphism classes of graphs (Q3978523) (← links)
- (Q4326178) (← links)
- Graph distances using graph union (Q4795068) (← links)
- Characterisation and classification of signatures of spanning trees of the $n$-cube (Q5206928) (← links)
- Transition operations over plane trees (Q5918848) (← links)
- Sequences of spanning trees and a fixed tree theorem (Q5959551) (← links)
- On decreasing the orders of \((k,g)\)-graphs (Q6181335) (← links)
