Cover Image

Reconfiguration of Independent Transversals

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Buys, Pjotr, Kang, Ross J., Ozeki, Kenta
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Data Structures and Algorithms 05C35, 05C69, 05C15, 68R05, 68R10
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

$(t,r)$ Broadcast Domination Numbers and Densities of the Truncated Square Tiling Graph
by: Cervantes, Jillian, et al.
Published: (2024)

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

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

The vertex Folkman number $F_v(3,3;5)$ equals~$8$
by: Niu, Tong
Published: (2026)

A Linear Kernel for Independent Set Reconfiguration in Planar Graphs
by: Bousquet, Nicolas, et al.
Published: (2025)

Optimal Adjacency Labels for Subgraphs of Cartesian Products
by: Esperet, Louis, et al.
Published: (2022)

The maximum number of connected sets in regular graphs
by: Cambie, Stijn, et al.
Published: (2023)

On $γ$-Contraction and $β$-Contraction: A Unified Framework for Colour-Preserving Graph Reduction
by: Onofri, Elia
Published: (2024)

Polynomial $χ$-boundedness for excluding $P_5$
by: Nguyen, Tung H.
Published: (2025)

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions
by: Oum, Sang-il, et al.
Published: (2026)

The zero blocking numbers of grid graphs
by: Lin, Hau-Yi, et al.
Published: (2025)

Zero blocking numbers of graphs with complexity results
by: Lin, Hau-Yi, et al.
Published: (2025)

Sharp bounds for product and sum throttling numbers
by: Blair, Ryan, et al.
Published: (2025)

The zero blocking numbers of generalized Kneser graphs and generalized Johnson graphs
by: Lin, Hau-Yi, et al.
Published: (2025)

The Power Domination Toolbox
by: Koch, Johnathan, 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)

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

Irreversible $k$-Threshold Dynamics on Corona and Base-$b$ Corona Product Graphs
by: Moon, Eric J., et al.
Published: (2025)

Dirac's theorem and the switch geometry of perfect matchings
by: Kang, Ross J., et al.
Published: (2026)

Optimal Bounds for the k-Disjoint Paths Problem
by: Cavallaro, Dario, et al.
Published: (2026)

Theoretical results for Perfect Location signed Roman domination problem
by: Nikolić, Bojan, et al.
Published: (2025)

Perfecting the Line Graph
by: Bal, Hartosh Singh
Published: (2025)

Finding irrelevant vertices in linear time on bounded-genus graphs
by: Golovach, Petr A., et al.
Published: (2019)

Minimal obstructions to $C_5$-coloring in hereditary graph classes
by: Goedgebeur, Jan, et al.
Published: (2024)

Obstructions to Erdős-Pósa Dualities for Minors
by: Paul, Christophe, et al.
Published: (2024)

On the Complexity of Distance-$d$ Independent Set Reconfiguration
by: Hoang, Duc A.
Published: (2022)

The Algorithmic Phase Transition of Random Graph Alignment Problem
by: Du, Hang, et al.
Published: (2023)

BFS versus DFS for random targets in ordered trees
by: Dimitrov, Stoyan, et al.
Published: (2024)

The Behavior of Tree-Width and Path-Width under Graph Operations and Graph Transformations
by: Gurski, Frank, et al.
Published: (2024)

Killing a Vortex
by: Thilikos, Dimitrios M., et al.
Published: (2022)

Analyzing Network Robustness via Residual Closeness
by: Golpek, Hande Tuncel, et al.
Published: (2026)

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

An efficient algorithm for generating transmission irregular trees
by: Stošić, Ivan, et al.
Published: (2025)

Self-identifying codes in direct products of complete graphs with paths and cycles
by: Liu, Jihong, et al.
Published: (2025)

Vertex identification to a forest
by: Morelle, Laure, et al.
Published: (2024)

Faster parameterized algorithms for modification problems to minor-closed classes
by: Morelle, Laure, et al.
Published: (2022)

On algorithmic applications of sim-width and mim-width of $(H_1, H_2)$-free graphs
by: Munaro, Andrea, et al.
Published: (2022)

Three results towards the approximation of special maximum matchings in graphs
by: Mkrtchyan, Vahan
Published: (2024)

$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses
by: Contreras-Mendoza, Fernando Esteban, et al.
Published: (2022)

Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
by: Inoue, Yuta, et al.
Published: (2024)