Cover Image

On plane cycles in geometric multipartite graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ricci, Marco, Rollin, Jonathan, Schulz, André, Weinberger, Alexandra
Format:	Preprint
Published:	2025
Subjects:	Computational Geometry Combinatorics 68R10 G.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Diameter Constraints in 2-distance Graphs
by: Al-saadi, Oleksiy, et al.
Published: (2025)

On the twin-width of near-regular graphs
by: Heinrich, Irene, et al.
Published: (2025)

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

Hypercube drawings with no long plane paths
by: Antić, Todor, et al.
Published: (2026)

Fast winning strategies for the attacker in eternal domination
by: Bagan, Guillaume, et al.
Published: (2024)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
by: Cavallaro, Dario, et al.
Published: (2026)

Searching by Heterogeneous Agents
by: Dereniowski, Dariusz, et al.
Published: (2021)

On the spectra of prefix-reversal graphs
by: Blanco, Saúl A., et al.
Published: (2025)

Some integer values in the spectra of burnt pancake graphs
by: Blanco, Saúl A., et al.
Published: (2024)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
by: Gabryelski, Wojciech, et al.
Published: (2026)

Adjacent vertex distinguishing total coloring of 3-degenerate graphs
by: Behera, Diptimaya, et al.
Published: (2025)

Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)

SCNode: Spatial and Contextual Coordinates for Graph Representation Learning
by: Uddin, Md Joshem, et al.
Published: (2024)

An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets
by: Flores-Peñaloza, David, et al.
Published: (2024)

On Grundy indices for complete geometric graphs
by: Lara, Dolores, et al.
Published: (2025)

Paired 2-disjoint path covers of Bcube under the partitioned edge fault model
by: Zhang, Wenjing, et al.
Published: (2025)

Excluding surfaces as minors in graphs
by: Thilikos, Dimitrios M., et al.
Published: (2026)

Crossing Numbers of Beyond Planar Graphs Re-revisited: A Framework Approach
by: Chimani, Markus, et al.
Published: (2024)

Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)

Reconfigurations of Plane Caterpillars and Paths
by: Antić, Todor, et al.
Published: (2024)

Star-Forest Decompositions of Complete Graphs
by: Antić, Todor, et al.
Published: (2024)

Bounds on the Twin-Width of Product Graphs
by: Pettersson, William, et al.
Published: (2022)

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
by: Asiri, Zayed, et al.
Published: (2024)

Folding One Polyhedral Metric Graph into Another
by: Chung, Lily, et al.
Published: (2024)

Lozenge Tiling by Computing Distances
by: Favreau, Jean-Marie, et al.
Published: (2026)

Monotone Arc Diagrams with few Biarcs
by: Chaplick, Steven, et al.
Published: (2024)

Topological Indices With Degree Sequence $\mathscr{D}$ of Tree
by: Hamoud, Jasem, et al.
Published: (2025)

The partial gossip problem revisited
by: Kokhas, Konstantin, et al.
Published: (2026)

Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)

Packing, Hitting, and Colouring Squares
by: Caoduro, Marco, et al.
Published: (2022)

Realizability of Rectangular Euler Diagrams
by: Dürrschnabel, Dominik, et al.
Published: (2024)

Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)

Quickly excluding an annotated planar graph
by: Gorsky, Maximilian, et al.
Published: (2026)

Homomorphism Counts to Trees
by: Dawar, Anuj
Published: (2024)

Logarithmic Weisfeiler--Leman and Treewidth
by: Levet, Michael, et al.
Published: (2023)

Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
by: Levet, Michael, et al.
Published: (2023)

Large cliques and large independent sets: can they coexist?
by: Feige, Uriel, et al.
Published: (2025)