Image de couverture de livre

A Complexity Dichotomy for Generalized Rainbow Matchings Based on Color Classes

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hommelsheim, Felix, Jehmlich, Pia, Mühlenthaler, Moritz
Format:	Preprint
Publié:	2026
Sujets:	Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Independent set reconfiguration in H-free graphs
par: Bartier, Valentin, et autres
Publié: (2024)

A simple quadratic kernel for Token Jumping on surfaces
par: Cranston, Daniel W., et autres
Publié: (2024)

Complexity of Deciding the Equality of Matching Numbers
par: Gomes, Guilherme C. M., et autres
Publié: (2024)

Rainbow Trees in Hypercubes
par: Crawford, Nicholas, et autres
Publié: (2025)

Density Matters: A Complexity Dichotomy of Deleting Edges to Bound Subgraph Density
par: Bentert, Matthias, et autres
Publié: (2026)

The Rainbow Arborescence Problem on Cycles
par: Bérczi, Kristóf, et autres
Publié: (2025)

Rainbow copies of spanning subgraphs
par: Cooper, Colin, et autres
Publié: (2025)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
par: Dreier, Jan, et autres
Publié: (2024)

Proper Rainbow Saturation Numbers for Cycles
par: Halfpap, Anastasia, et autres
Publié: (2024)

Coloring and Recognizing Directed Interval Graphs
par: Gutowski, Grzegorz, et autres
Publié: (2023)

On the Complexity of Hop Domination and 2-Step Domination in Graph Classes
par: Das, Sandip, et autres
Publié: (2026)

The Complexity of Color-constrained Paths in Semicomplete Multipartite Digraphs
par: Brinkmann, Julian
Publié: (2025)

Reconfiguring homomorphisms to reflexive graphs via a simple reduction
par: Mühlenthaler, Moritz, et autres
Publié: (2024)

Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates
par: Falgas-Ravry, Victor, et autres
Publié: (2022)

Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
par: Bok, Jan, et autres
Publié: (2025)

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
par: Lucke, Felicia, et autres
Publié: (2023)

A Dichotomy for Maximum PCSPs on Graphs
par: Nakajima, Tamio-Vesa, et autres
Publié: (2024)

Critical Thresholds for Maximum Cardinality Matching on General Hypergraphs
par: Sumnicht, Christopher, et autres
Publié: (2024)

A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2022)

Stable Matching: Dealing with Changes in Preferences
par: Gangam, Rohith Reddy, et autres
Publié: (2023)

Rainbow Arborescence Conjecture
par: Bérczi, Kristóf, et autres
Publié: (2024)

Rainbow polygons for colored point sets in the plane
par: Flores-Peñaloza, David, et autres
Publié: (2020)

Coloring Mixed and Directional Interval Graphs
par: Gutowski, Grzegorz, et autres
Publié: (2022)

Towards a geometric characterization of unbounded integer cubic optimization problems via thin rays
par: Del Pia, Alberto
Publié: (2025)

Factorized binary polynomial optimization
par: Del Pia, Alberto
Publié: (2024)

Projection-width as a structural parameter for discrete separable optimization
par: Del Pia, Alberto
Publié: (2025)

The Mixed Integer Trust Region Problem
par: Del Pia, Alberto
Publié: (2024)

Matchings in permutations
par: Inozemtsev, Eduard, et autres
Publié: (2026)

First-Fit Coloring of Forests in Random Arrival Model
par: Bosek, Bartłomiej, et autres
Publié: (2024)

How to Color Temporal Graphs to Ensure Proper Transitions
par: Ibiapina, Allen, et autres
Publié: (2025)

The Complexity of Finding Tangles
par: Firman, Oksana, et autres
Publié: (2020)

Ternary Binomial and Trinomial Bent Functions in the Completed Maiorana-McFarland Class
par: Helleseth, Tor, et autres
Publié: (2025)

Topological Analysis and Synthesis of Structures related to Certain Classes of K-Geodetic Computer Networks
par: Frasser, Carlos E.
Publié: (2017)

Matchings on Random Regular Hypergraphs
par: Li, Zhongyang
Publié: (2021)

A Novel Approach for Bent Functions with Dillon-like Exponents and Characterizing Three Classes of Bent Functions via Kloosterman Sums
par: Tu, Ziran, et autres
Publié: (2024)

Reducing Profile-Based Matching to the Maximum Weight Matching Problem
par: Park, Seongbeom
Publié: (2025)

A Note on Polychromatic Colorings of Shift-Chains
par: Ueckerdt, Torsten
Publié: (2024)

Banach density of generated languages: Dichotomies in topology and dimension
par: Kleinberg, Jon, et autres
Publié: (2026)

Comparing Width Parameters on Graph Classes
par: Brettell, Nick, et autres
Publié: (2023)

An SDP Relaxation for the Sparse Integer Least Squares Problem
par: Del Pia, Alberto, et autres
Publié: (2022)