Cover Image

The Upper Clique Transversal Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Milanič, Martin, Uno, Yushi
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Computational Complexity Discrete Mathematics Data Structures and Algorithms 05C69 (Primary), 05C85, 05C75, 05C76, 68Q25, 68R10 (Secondary)
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Structure and algorithms for graphs excluding grids with small parity breaks as odd-minors
by: Gollin, J. Pascal, et al.
Published: (2023)

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

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

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

Fault-tolerant mutual-visibility: complexity and solutions for grid-like networks
by: Cicerone, Serafino, et al.
Published: (2025)

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

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

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

On $\{k\}$-Roman graphs: complexity of recognition and the case of split graphs
by: Štorgel, Kenny Bešter, et al.
Published: (2025)

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

Approximating branchwidth on parametric extensions of planarity
by: Thilikos, Dimitrios M., et al.
Published: (2023)

Colorful Minors
by: Protopapas, Evangelos, et al.
Published: (2025)

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

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

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

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

Optimal Hardness of Online Algorithms for Large Independent Sets
by: Gamarnik, David, et al.
Published: (2025)

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

On coloring graphs with well-distributed edge density
by: Hassan, Syed Mujtaba, et al.
Published: (2024)

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

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

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

Treewidth versus clique number. V. Further connections with tree-independence number
by: Hilaire, Claire, et al.
Published: (2025)

Symmetry classes of Hamiltonian cycles
by: Baligacs, Julia, et al.
Published: (2025)

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

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