:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Kim, Dohoon, Woo, Eungyu, Shin, Donghoon
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics Computational Complexity
Acceso en línea:	https://arxiv.org/abs/2604.18949
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On a Hierarchy of Spectral Invariants for Graphs
por: Arvind, V., et al.
Publicado: (2023)

On the Structure of Hamiltonian Graphs with Small Independence Number
por: Jedličková, Nikola, et al.
Publicado: (2024)

Direct Product Primality Testing of Graphs is GI-hard
por: Calderoni, Luca, et al.
Publicado: (2020)

Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
por: Eagling-Vose, Tala, et al.
Publicado: (2025)

The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rzążewski Conjecture
por: Baril, Ambroise, et al.
Publicado: (2024)

Small Even Covers, Locally Decodable Codes and Restricted Subgraphs of Edge-Colored Kikuchi Graphs
por: Hsieh, Jun-Ting, et al.
Publicado: (2024)

Representing Matroids over the Reals is $\exists \mathbb R$-complete
por: Kim, Eun Jung, et al.
Publicado: (2023)

Parks: A Doubly Infinite Family of NP-Complete Puzzles and Generalizations of A002464
por: Minevich, Igor, et al.
Publicado: (2024)

Reconfiguring Graph Homomorphisms on the Sphere
por: Lee, Jae-Baek, et al.
Publicado: (2018)

Determining the Outerthickness of Graphs Is NP-Hard
por: Lee, Pin-Hsian, et al.
Publicado: (2026)

The Interplay Between Domination and Separation in Graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2026)

Graph Irregularity via Edge Deletions
por: Bensmail, Julien, et al.
Publicado: (2025)

Complexity Aspects of Homomorphisms of Ordered Graphs
por: Čertík, Michal, et al.
Publicado: (2025)

On Computational Aspects of Cores of Ordered Graphs
por: Čertík, Michal, et al.
Publicado: (2025)

Testing Isomorphism of Graphs in Polynomial Time
por: Xue, Rui
Publicado: (2023)

Hardness of 4-Colourings G-Colourable Graphs
por: Avvakumov, Sergey, et al.
Publicado: (2025)

Finding d-Cuts in Claw-free Graphs
por: Ahn, Jungho, et al.
Publicado: (2025)

Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
por: Concha-Vega, Pablo
Publicado: (2026)

Finding Minimum Matching Cuts in $H$-free Graphs
por: Lucke, Felicia, et al.
Publicado: (2025)

The Subgraph Isomorphism Problem for Port Graphs and Quantum Circuits
por: Mondada, Luca, et al.
Publicado: (2023)

An Efficient Algorithm to Generate all Labeled Triangle-free Graphs with a given Graphical Degree Sequence
por: Wang, Kai
Publicado: (2026)

Matching Cut and Variants on Bipartite Graphs of Bounded Radius and Diameter
por: Lucke, Felicia
Publicado: (2025)

Algorithmic methods of finite discrete structures. Graph clique problem
por: Kurapov, Sergey, et al.
Publicado: (2024)

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

On $[1,2]$-Domination in Interval and Circle Graphs
por: Meybodi, Mohsen Alambardar, et al.
Publicado: (2024)

A Note on the Complexity of Directed Clique
por: Gutowski, Grzegorz, et al.
Publicado: (2026)

Completeness in the Polynomial Hierarchy and PSPACE for many natural problems derived from NP
por: Grüne, Christoph, et al.
Publicado: (2026)

A Hypergraph Container Method on Spread SAT: Approximation and Speedup
por: Han, Zicheng, et al.
Publicado: (2026)

Classification of Non-redundancy of Boolean Predicates of Arity 4
por: Brakensiek, Joshua, et al.
Publicado: (2026)

King Chasing Problem in Chinese Chess is NP-hard
por: Li, Chao, et al.
Publicado: (2026)

Between proper and square coloring of planar graphs, hardness and extremal graphs
por: Delépine, Thomas
Publicado: (2026)

The Lens of Abelian Embeddings
por: Minzer, Dor
Publicado: (2026)

Communication Complexity of Disjointness under Product Distributions
por: Hunter, Zach, et al.
Publicado: (2026)

Low-Degree Polynomials Are Good Extractors
por: Alrabiah, Omar, et al.
Publicado: (2024)

Refuting Perfect Matchings in Spectral Expanders is Hard
por: Biswas, Ari, et al.
Publicado: (2025)

Monotone Circuit Complexity of Matching
por: Cavalar, Bruno, et al.
Publicado: (2025)

Hunting a rabbit: complexity, approximability and some characterizations
por: Ben-Ameur, Walid, et al.
Publicado: (2025)

On the Keevash-Knox-Mycroft Conjecture
por: Gan, Luyining, et al.
Publicado: (2022)

On Degeneracy in the P-Matroid Oriented Matroid Complementarity Problem
por: Borzechowski, Michaela, et al.
Publicado: (2023)

Sparse juntas on the biased hypercube
por: Dinur, Irit, et al.
Publicado: (2017)