Cover Image

Flipping odd matchings in geometric and combinatorial settings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Aichholzer, Oswin, Brenner, Sofia, Dorfer, Joseph, Hoang, Hung P., Perz, Daniel, Rieck, Christian, Verciani, Francesco
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry Discrete Mathematics Combinatorics F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

On the Connectivity of the Flip Graph of Plane Spanning Paths
by: Kleist, Linda, et al.
Published: (2024)

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

Disproving two conjectures on the Hamiltonicity of Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)

Flips in colorful triangulations
by: Acharya, Rohan, et al.
Published: (2024)

Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
by: Dorfer, Joseph
Published: (2026)

On minimum Venn diagrams
by: Brenner, Sofia, et al.
Published: (2025)

Optimal covering of rectangular grid graphs with tours of constrained length
by: Bereg, Sergey, et al.
Published: (2025)

Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023)

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)

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

Intersection patterns of set systems on manifolds with slowly growing homological shatter functions
by: Avvakumov, Sergey, et al.
Published: (2026)

Some Counterexamples for Compatible Triangulations
by: Barnson, Cody, et al.
Published: (2016)

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

A Tight Lower Bound on Cubic Vertices and Upper Bounds on Thin and Non-thin edges in Planar Braces
by: De, Koustav
Published: (2025)

An Upper Bound for the Double Domination Number in Maximal Outerplanar Graphs
by: Araki, Toru
Published: (2026)

Revisiting classical results on kernels in digraphs
by: Langlois, Hélène, et al.
Published: (2025)

Monotonicity of the cops and robber game for bounded depth treewidth
by: Adler, Isolde, et al.
Published: (2024)

Flips in Odd Matchings
by: Aichholzer, Oswin, et al.
Published: (2024)

Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs
by: Büngener, Aaron, et al.
Published: (2024)

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

Flipping Matchings is Hard
by: Binucci, Carla, et al.
Published: (2025)

Compact Representation of Semilinear and Terrain-like Graphs
by: Cardinal, Jean, et al.
Published: (2025)

On Minimum Maximal Distance-k Matchings
by: Kartynnik, Yury, et al.
Published: (2016)

Edge coloring lattice graphs
by: Kattemölle, Joris
Published: (2024)

On star-$k$-PCGs: Exploring class boundaries for small $k$ values
by: Monti, Angelo, et al.
Published: (2022)

On the hull and interval numbers of oriented graphs
by: Araujo, J., et al.
Published: (2022)

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

Binary Stretch Embedding of Weighted Graphs
by: Ebrahimi, Javad B., et al.
Published: (2024)

New Results on Edge-coloring and Total-coloring of Split Graphs
by: Couto, Fernanda, et al.
Published: (2023)

Flip-width: Cops and Robber on dense graphs
by: Toruńczyk, Szymon
Published: (2023)

On λ-backbone coloring of cliques with tree backbones in linear time
by: Michalik, Krzysztof, et al.
Published: (2021)

Online Bipartite Matching in the Probe-Commit Model
by: Borodin, Allan, et al.
Published: (2023)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
by: Ma, Will, et al.
Published: (2024)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
by: MacRury, Calum, et al.
Published: (2022)

Algorithmic Applications of Tyshkevich's Graph Decomposition: A Primer and a Toolkit
by: Cheng, Christine T., et al.
Published: (2026)

Recognizing Relating Edges in Graphs without Cycles of Length 6
by: Levit, Vadim E., et al.
Published: (2024)

Some Thoughts on Graph Similarity
by: Grohe, Martin
Published: (2024)

On minimally tough chordal graphs
by: Dallard, Clément, et al.
Published: (2022)