:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Lü, Huazhong, Wu, Tingzeng
Format:	Preprint
Published:	2021
Subjects:	Computational Complexity Combinatorics 03D15, 05C40, 68R10
Online Access:	https://arxiv.org/abs/2110.05917
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A dichotomy theorem for $Γ$-switchable $H$-colouring on $m$-edge coloured graphs
by: Brewster, Richard, et al.
Published: (2023)

Complexity of chess domination problems
by: Langlois-Rémillard, Alexis, et al.
Published: (2022)

Results on three problems on isolation of graphs
by: Borg, Peter, et al.
Published: (2026)

Exploring P versus NP
by: Tang, Jian-Gang
Published: (2022)

Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness
by: Tzameret, Iddo, et al.
Published: (2023)

Degree-preserving graph dynamics -- a versatile process to construct random networks
by: Erdős, Péter L., et al.
Published: (2021)

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

Equivalences of promise compactness principles
by: Bodor, Bertalan
Published: (2026)

Infinite Eulerian paths are computable on graphs with vertices of infinite degree
by: Carrasco-Vargas, Nicanor
Published: (2023)

Visualizing Geophylogenies -- Internal and External Labeling with Phylogenetic Tree Constraints
by: Klawitter, Jonathan, et al.
Published: (2023)

Small palindromic lengths in free groups and word equations with antimorphisms
by: Frid, Anna E.
Published: (2025)

Paired many-to-many 2-disjoint path cover of Johnson graphs
by: Liu, Jinhao, et al.
Published: (2025)

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

Rainbow connectivity of multilayered random geometric graphs
by: Díaz, Josep, et al.
Published: (2024)

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

Paths, Ends and The Separation Problem for Infinite Graphs
by: Carrasco-Vargas, Nicanor, et al.
Published: (2024)

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

On dispersability of some circulant graphs
by: Kainen, Paul C., et al.
Published: (2021)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
by: Bannach, Max, et al.
Published: (2025)

Canonical graph decompositions via local separations
by: Jacobs, Raphael W., et al.
Published: (2025)

Symmetric properties and two variants of shuffle-cubes
by: Lü, Huazhong, et al.
Published: (2021)

Three-edge-coloring (Tait coloring) cubic graphs on the torus: A proof of Grünbaum's conjecture
by: Inoue, Yuta, et al.
Published: (2025)

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

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

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

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

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

The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs
by: Ahn, Jungho, et al.
Published: (2022)

Computability of Classification and Deep Learning: From Theoretical Limits to Practical Feasibility through Quantization
by: Boche, Holger, et al.
Published: (2024)

Evolomino is NP-complete
by: Nikolaev, Andrei V.
Published: (2025)

Towards Characterization of 5-List-Colorability of Toroidal Graphs
by: Dvořák, Zdeněk, et al.
Published: (2024)

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

Circular-arc H-graphs: Ordering Characterizations and Forbidden Patterns
by: Paul, Indrajit, et al.
Published: (2025)

Computational complexity of counting coincidences
by: Chan, Swee Hong, et al.
Published: (2023)

State Canonization and Early Pruning in Width-Based Automated Theorem Proving
by: Oliveira, Mateus de Oliveira, et al.
Published: (2026)

Algorithmic counting of nonequivalent compact Huffman codes
by: Elsholtz, Christian, et al.
Published: (2019)

Monochromatic 4-AP avoidance in 2-colorings of Z/pZ for primes p >= 5 and a computation of W_c(4,2)
by: Irawan, Keane Maverick
Published: (2025)

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

An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
by: Mkrtchyan, Vahan
Published: (2024)

Infinite families of planar graphs of a given injective chromatic number
by: Daneels, Matias, et al.
Published: (2024)