On finding convex cuts in general, bipartite and plane graphs
From MaRDI portal
Publication:2402674
DOI10.1016/j.tcs.2017.07.026zbMath1375.05067OpenAlexW2745163768MaRDI QIDQ2402674
Henning Meyerhenke, Roland Glantz
Publication date: 13 September 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.07.026
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Isometric embedding in products of complete graphs
- Cubic partial cubes from simplicial arrangements
- Convex \(p\)-partitions of bipartite graphs
- A characterization of planar partial cubes
- Partial cubes: Structures, characterizations, and constructions
- On scale embeddings of graphs into hypercubes
- Clin d'oeil on \(L_1\)-embeddable planar graphs
- On the convexity number of graphs
- Partitioning a graph into convex sets
- Distance-preserving subgraphs of hypercubes
- Distance and routing labeling schemes for non-positively curved plane graphs
- Graphs with intrinsic s3 convexities
- The Jordan-Schonflies Theorem and the Classification of Surface
- Product graph representations
- Oriented Matroids
- Isometric subgraphs of Hamming graphs and d-convexity
- Finding All Convex Cuts of a Plane Graph in Cubic Time
- Geometry of cuts and metrics
