Imagen de Portada

Drawings of Complete Multipartite Graphs Up to Triangle Flips

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Aichholzer, Oswin, Chiu, Man-Kwun, Hoang, Hung P., Hoffmann, Michael, Kynčl, Jan, Maus, Yannic, Vogtenhuber, Birgit, Weinberger, Alexandra
Formato:	Preprint
Publicado:	2023
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Towards Crossing-Free Hamiltonian Cycles in Simple Drawings of Complete Graphs
por: Aichholzer, Oswin, et al.
Publicado: (2023)

Constrained Flips in Plane Spanning Trees
por: Aichholzer, Oswin, et al.
Publicado: (2025)

Separable Drawings: Extendability and Crossing-Free Hamiltonian Cycles
por: Aichholzer, Oswin, et al.
Publicado: (2024)

Characterizing and Recognizing Twistedness
por: Aichholzer, Oswin, et al.
Publicado: (2025)

Structural Properties of Shortest Flip Sequences Between Plane Spanning Trees
por: Aichholzer, Oswin, et al.
Publicado: (2026)

Disjoint Compatibility via Graph Classes
por: Aichholzer, Oswin, et al.
Publicado: (2024)

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets
por: Aichholzer, Oswin, et al.
Publicado: (2025)

Flips in Odd Matchings
por: Aichholzer, Oswin, et al.
Publicado: (2024)

Flipping odd matchings in geometric and combinatorial settings
por: Aichholzer, Oswin, et al.
Publicado: (2025)

Folding polyominoes into cubes
por: Aichholzer, Oswin, et al.
Publicado: (2024)

Flipping Non-Crossing Spanning Trees
por: Bjerkevik, Håvard Bakke, et al.
Publicado: (2024)

Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
por: Aichholzer, Oswin, et al.
Publicado: (2026)

Connected Matchings
por: Aichholzer, Oswin, et al.
Publicado: (2024)

Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
por: Bjerkevik, Håvard Bakke, et al.
Publicado: (2026)

Garment numbers of bi-colored point sets in the plane
por: Aichholzer, Oswin, et al.
Publicado: (2026)

Geometric Give and Take
por: Aichholzer, Oswin, et al.
Publicado: (2026)

Extending simple monotone drawings
por: Kynčl, Jan, et al.
Publicado: (2023)

Crossing and non-crossing families
por: Antić, Todor, et al.
Publicado: (2025)

On the geometric $k$-colored crossing number of $K_n$
por: Hahn, Benedikt, et al.
Publicado: (2025)

Adjacency Graphs of Polyhedral Surfaces
por: Arseneva, Elena, et al.
Publicado: (2021)

Crossing Number of 3-Plane Drawings
por: Goetze, Miriam, et al.
Publicado: (2025)

Recognition of Unit Segment and Polyline Graphs is $\exists\mathbb{R}$-Complete
por: Hoffmann, Michael, et al.
Publicado: (2024)

Grounded String Representations of Series-Parallel Graphs without Transitive Edges
por: Cornelsen, Sabine, et al.
Publicado: (2026)

Bowties and Hourglasses: Intersections of Double-Wedges (or Stabbing and Avoiding Line Segments)
por: Bertschinger, Daniel, et al.
Publicado: (2026)

Morphing Planar Graph Drawings via Orthogonal Box Drawings
por: Biedl, Therese, et al.
Publicado: (2024)

Min-$k$-planar Drawings of Graphs
por: Binucci, Carla, et al.
Publicado: (2023)

Flips and Flops Constructed by GIT Quotient
por: Chang, Hung-Pin
Publicado: (2024)

What induces plane structures in complete graph drawings?
por: Weinberger, Alexandra, et al.
Publicado: (2026)

On the Uncrossed Number of Graphs
por: Balko, Martin, et al.
Publicado: (2024)

Parallel Graph Drawing Algorithm for Bipartite Planar Graphs
por: Jain, Naman
Publicado: (2024)

Monotonically Decreasing the Number of Directed 3-Cycles via Edge-Flips?
por: Bom, David, et al.
Publicado: (2025)

k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
por: Hliněný, Petr, et al.
Publicado: (2025)

On Distributed Colouring of Hyperbolic Random Graphs
por: Maus, Yannic, et al.
Publicado: (2025)

Morphing Graph Drawings in the Presence of Point Obstacles
por: Firman, Oksana, et al.
Publicado: (2023)

Planar Stories of Graph Drawings: Algorithms and Experiments
por: Binucci, Carla, et al.
Publicado: (2025)

Same Quality Metrics, Different Graph Drawings
por: van Wageningen, Simon, et al.
Publicado: (2025)

Scalable Exact Hierarchical Agglomerative Clustering via Sparse Geographic Distance Graphs
por: Maus, Victor, et al.
Publicado: (2026)

Graph Drawing Stress Model with Resistance Distances
por: Onoue, Yosuke
Publicado: (2025)

Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs
por: Bose, Prosenjit, et al.
Publicado: (2025)

Geometric Thickness of Multigraphs is $\exists \mathbb{R}$-complete
por: Förster, Henry, et al.
Publicado: (2023)