Imagen de Portada

The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Feghali, Carl, Le, Hoang-Oanh, Le, Van Bang
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Computational Complexity Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs
por: Le, Hoang-Oanh, et al.
Publicado: (2024)

The complexity of strong conflict-free vertex-connection $k$-colorability
por: Hsieh, Sun-Yuan, et al.
Publicado: (2024)

Computing Subset Vertex Covers in $H$-Free Graphs
por: Brettell, Nick, et al.
Publicado: (2023)

Explicit Two-Sided Vertex Expanders Beyond the Spectral Barrier
por: Hsieh, Jun-Ting, et al.
Publicado: (2024)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers
por: Beisegel, Jesse, et al.
Publicado: (2025)

Isometric path complexity of graphs
por: Chakraborty, Dibyayan, et al.
Publicado: (2022)

Strong Sparsification for 1-in-3-SAT via Polynomial Freiman-Ruzsa
por: Bedert, Benjamin, et al.
Publicado: (2025)

Algorithms and complexity for monitoring edge-geodetic sets in graphs
por: Foucaud, Florent, et al.
Publicado: (2024)

On the parameterized complexity of Broadcast Independence and Broadcast Packing
por: Dumont, Joanne, et al.
Publicado: (2026)

Steiner Forest for $H$-Subgraph-Free Graphs
por: Eagling-Vose, Tala, et al.
Publicado: (2026)

Finding $d$-Cuts in Probe $H$-Free Graphs
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

Optimal b-Colourings and Fall Colourings in $H$-Free Graphs
por: Ahn, Jungho, et al.
Publicado: (2026)

The Parameterized Complexity of Vertex-Coloring Edge-Weighting
por: Aute, Shubhada, et al.
Publicado: (2026)

Explicit Almost-Optimal $\varepsilon$-Balanced Codes via Free Expander Walks
por: Hsieh, Jun-Ting, et al.
Publicado: (2026)

Explicit Lossless Vertex Expanders
por: Hsieh, Jun-Ting, et al.
Publicado: (2025)

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
por: Hellmuth, Marc, et al.
Publicado: (2023)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
por: Lucke, Felicia, et al.
Publicado: (2024)

Complexity and algorithms for matching cut problems in graphs without long induced paths and cycles
por: Le, Hoang-Oanh, et al.
Publicado: (2023)

On the complexity of constrained reconfiguration and motion planning
por: Bousquet, Nicolas, et al.
Publicado: (2025)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
por: Scheffler, Robert
Publicado: (2025)

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
por: Eagling-Vose, Tala, et al.
Publicado: (2025)

Space Efficient Algorithms for Parameterised Problems
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2025)

An unconditional lower bound for the active-set method on the hypercube
por: Disser, Yann, et al.
Publicado: (2025)

An unconditional lower bound for the active-set method in convex quadratic maximization
por: Bach, Eleon, et al.
Publicado: (2025)

The tape reconfiguration problem and its consequences for dominating set reconfiguration
por: Bousquet, Nicolas, et al.
Publicado: (2025)

Graph Classes Closed under Self-intersection
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

On a tree-based variant of bandwidth and forbidding simple topological minors
por: Jacob, Hugo, et al.
Publicado: (2025)

An $\mathcal{O}(n)$ Space Construction of Superpermutations
por: Ajmera, Dhruv
Publicado: (2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
por: Beisegel, Jesse, et al.
Publicado: (2025)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths
por: Beisegel, Jesse, et al.
Publicado: (2025)

Exact Algorithms for Edge Deletion to Cactus
por: Akhtar, Sheikh Shakil, et al.
Publicado: (2026)

Graph Search Trees and the Intermezzo Problem
por: Beisegel, Jesse, et al.
Publicado: (2024)

Enumeration of minimal transversals of hypergraphs of bounded VC-dimension
por: Mary, Arnaud
Publicado: (2024)

Solving Problems on Generalized Convex Graphs via Mim-Width
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2020)

A Fixed-Parameter Algorithm for the Kneser Problem
por: Haviv, Ishay
Publicado: (2022)

Parameterized Complexity of (d,r)-Domination via Modular Decomposition
por: Cordasco, Gennaro, et al.
Publicado: (2024)

Computing Hamiltonian Paths with Partial Order Restrictions
por: Beisegel, Jesse, et al.
Publicado: (2024)

An efficient uniqueness theorem for overcomplete tensor decomposition
por: Koiran, Pascal
Publicado: (2024)

(Independent) Roman Domination Parameterized by Distance to Cluster
por: Ashok, Pradeesha, et al.
Publicado: (2024)

On graphs coverable by k shortest paths
por: Dumas, Maël, et al.
Publicado: (2022)