Connectivity of graphs under edge flips
From MaRDI portal
Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)
Recommendations
This page was built for publication: Connectivity of graphs under edge flips
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315368)