Cover Image

Reconfiguring homomorphisms to reflexive graphs via a simple reduction

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mühlenthaler, Moritz, Siggers, Mark H., Suzan, Thomas
Format:	Preprint
Published:	2024
Subjects:	Discrete Mathematics Data Structures and Algorithms 05C85 (Primary) 05C15, 68Q25 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Young domination on Hamming rectangles
by: Gravner, Janko, et al.
Published: (2025)

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

An Algorithm to Recover Shredded Random Matrices
by: Atamanchuk, Caelan, et al.
Published: (2023)

Fundamentals of Partial Rejection Sampling
by: Jerrum, Mark
Published: (2021)

Recolouring Homomorphisms to triangle-free reflexive graphs
by: Lee, Jae-baek, et al.
Published: (2021)

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

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

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

Recognizing Level-k-Based Phylogenetic Networks is NP-Complete
by: Suzuki, Takatora
Published: (2026)

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

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

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

The Complexity of Distance-$r$ Dominating Set Reconfiguration
by: Banerjee, Niranka, et al.
Published: (2023)

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

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

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

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

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

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

Towards a dichotomy for the switch list homomorphism problem for signed graphs
by: Kim, Hyobin, et al.
Published: (2021)

On balanceable and simply balanceable regular graphs
by: Ahanjideh, Milad, et al.
Published: (2024)

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

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

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

A greedy heuristic for graph burning
by: García-Díaz, Jesús, et al.
Published: (2024)

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

A New Temporal Interpretation of Cluster Editing
by: Bocci, Cristiano, et al.
Published: (2022)

Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
by: Baste, Julien, et al.
Published: (2019)

Low Recourse Arborescence Forests Under Uniformly Random Arcs
by: Dahlmeier, J Niklas, et al.
Published: (2025)

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems
by: Grigoriev, Alexander, et al.
Published: (2025)

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

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

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

Odd Cycle Transversal on $P_5$-free Graphs in Polynomial Time
by: Agrawal, Akanksha, et al.
Published: (2024)

Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs
by: Furmańczyk, Hanna, et al.
Published: (2020)

Coordinatewise Balanced Covering for Linear Gain Graphs, with an Application to Coset-List Min-2-Lin over Powers of Two
by: Alpay, Faruk, et al.
Published: (2026)

Totally $Δ$-Modular Tree Decompositions of Graphic Matrices for Integer Programming
by: McFarland, Caleb
Published: (2026)