Cover Image

Young domination on Hamming rectangles

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gravner, Janko, Krnc, Matjaž, Milanič, Martin, Raymond, Jean-Florent
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics Data Structures and Algorithms 05C35 (Primary) 05C69, 05C85, 68W25 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star
by: Dallard, Clément, et al.
Published: (2024)

The Upper Clique Transversal Problem
by: Milanič, Martin, et al.
Published: (2023)

A tame vs. feral dichotomy for graph classes excluding an induced minor or induced topological minor
by: Milanič, Martin, et al.
Published: (2024)

Excluding an induced wheel minor in graphs without large induced stars
by: Choi, Mujin, et al.
Published: (2025)

Induced Minor Models. I. Structural Properties and Algorithmic Consequences
by: Bousquet, Nicolas, et al.
Published: (2024)

Zero-free regions of partition functions with applications to algorithms and graph limits
by: Regts, Guus
Published: (2015)

Conformality of Minimal Transversals of Maximal Cliques
by: Boros, Endre, et al.
Published: (2024)

Awesome graph parameters
by: Štorgel, Kenny Bešter, et al.
Published: (2025)

Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
by: Boros, Endre, et al.
Published: (2023)

Tree independence number V. Walls and claws
by: Chudnovsky, Maria, et al.
Published: (2025)

Supermodular Maximization with Cardinality Constraints
by: Chen, Xujin, et al.
Published: (2025)

Weighted domination models and randomized heuristics
by: Dijkstra, Lukas, et al.
Published: (2022)

Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs
by: Galby, Esther, et al.
Published: (2024)

On the joint embedding property for cographs and trees
by: Carter, Daniel
Published: (2024)

Isolation critical graphs under multiple edge subdivision
by: Bartolo, Karl, et al.
Published: (2026)

A simple quadratic kernel for Token Jumping on surfaces
by: Cranston, Daniel W., et al.
Published: (2024)

Reconfiguring homomorphisms to reflexive graphs via a simple reduction
by: Mühlenthaler, Moritz, et al.
Published: (2024)

Critical Relaxed-Stable Matchings with Ties in the Many-to-Many Setting
by: Nasre, Meghana, et al.
Published: (2023)

A $5/4$-Approximation for Two-Edge Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2024)

Tree decompositions meet induced matchings: beyond Max Weight Independent Set
by: Lima, Paloma T., et al.
Published: (2024)

Pathographs and some (un)decidability results
by: Carter, Daniel, et al.
Published: (2025)

Branch-width of connectivity functions is fixed-parameter tractable
by: Korhonen, Tuukka, et al.
Published: (2026)

More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives
by: Askari, Siavash, et al.
Published: (2024)

4-cop-win graphs have at least 19 vertices
by: Turcotte, Jérémie, et al.
Published: (2020)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
by: Hommelsheim, Felix
Published: (2025)

A $4/3$ Approximation for $2$-Vertex-Connectivity
by: Bosch-Calvo, Miguel, et al.
Published: (2023)

On 3-Coloring of $(2P_4,C_5)$-Free Graphs
by: Jelínek, Vít, et al.
Published: (2020)

The 2-domination number of cylindrical graphs
by: Martínez, José Antonio, et al.
Published: (2024)

Finding cliques and dense subgraphs using edge queries
by: Csóka, Endre, et al.
Published: (2023)

Resolving Sets in Temporal Graphs
by: Bok, Jan, et al.
Published: (2024)

A Constant-factor Approximation for Weighted Bond Cover
by: Kim, Eun Jung, et al.
Published: (2021)

Proof of a conjecture on isolation of graphs dominated by a vertex
by: Borg, Peter
Published: (2024)

Reconfiguration of Independent Transversals
by: Buys, Pjotr, et al.
Published: (2024)

Branch-width of represented matroids in matrix multiplication time
by: Choi, Mujin, et al.
Published: (2026)

Graphs with unique Grundy dominating sets
by: Brešar, Boštjan, et al.
Published: (2021)

Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-shortest Induced Paths
by: Chiu, Yung-Chung, et al.
Published: (2021)

Solving the Graph Burning Problem for Large Graphs
by: Pereira, Felipe de Carvalho, et al.
Published: (2024)

Perfect phylogenies via the Minimum Uncovering Branching problem: efficiently solvable cases
by: Baghirova, Narmina, et al.
Published: (2025)

Asymptotics of the Minimal Feedback Arc Set in Erdős-Rényi Graphs
by: Diamond, Harvey, et al.
Published: (2024)

Asymptotic Lower Bounds for the Feedback Arc Set Problem in Random Graphs
by: Diamond, Harvey, et al.
Published: (2024)