Distances between graphs under edge operations
From MaRDI portal
Publication:1356416
DOI10.1016/0012-365X(95)00073-6zbMath0954.05026MaRDI QIDQ1356416
Publication date: 12 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)
Related Items (11)
Characterisation and classification of signatures of spanning trees of the $n$-cube ⋮ Approximating degree sequences with regular graphic sequences (extended abstract) ⋮ The edge rotation graph ⋮ A quadratic distance bound on sliding between crossing-free spanning trees ⋮ On decreasing the orders of \((k,g)\)-graphs ⋮ Flips in planar graphs ⋮ On the diameter of geometric path graphs of points in convex position ⋮ Sequences of spanning trees and a fixed tree theorem ⋮ Degree-anonymization using edge rotations ⋮ Transition operations over plane trees ⋮ Graphic sequences, distances and \(k\)-degree anonymity
Cites Work
- Contraction distance between isomorphism classes of graphs
- Edge rotations and distance between graphs
- Comparison of various distances between isomorphism classes of graphs
- A metric for graphs
- On distances between isomorphism classes of graphs
- On a certain distance between isomorphism classes of graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Distances between graphs under edge operations
