Image de couverture de livre

The complexity of frugal digraph homomorphisms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bard, Stefan, MacGillivray, Gary, Swarts, Jacobus
Format:	Preprint
Publié:	2026
Sujets:	Combinatorics Computational Complexity 05C15
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A dichotomy theorem for $Γ$-switchable $H$-colouring on $m$-edge coloured graphs
par: Brewster, Richard, et autres
Publié: (2023)

Hamiltonicity of Bell and Stirling Colour Graphs
par: Finbow, Stephen, et autres
Publié: (2025)

Colourings of $(m, n)$-coloured mixed graphs
par: MacGillivray, Gary, et autres
Publié: (2020)

Bounding the Eviction Number of a Graph in Terms of its Independence Number
par: MacGillivray, Gary, et autres
Publié: (2025)

Homomorphically Full Oriented Graphs
par: Bellitto, Thomas, et autres
Publié: (2022)

The complexity of matroid homomorphism reconfiguration
par: Heo, Cheolwon, et autres
Publié: (2025)

Constricting the Computational Complexity Gap of the $4$-Coloring Problem in $(P_t,C_3)$-free Graphs
par: Jaworska, Justyna, et autres
Publié: (2025)

The proper conflict-free $k$-coloring problem and the odd $k$-coloring problem are NP-complete on bipartite graphs
par: Ahn, Jungho, et autres
Publié: (2022)

On complexity of substructure connectivity and restricted connectivity of graphs
par: Lü, Huazhong, et autres
Publié: (2021)

On the complexity of Sandwich Problems for $M$-partitions
par: Barsukov, Alexey, et autres
Publié: (2026)

The dib-chromatic number of digraphs
par: Javier-Nol, Nahid, et autres
Publié: (2024)

Cut covers of acyclic digraphs
par: Krone, Maximilian
Publié: (2024)

On the dib-chromatic number of a digraph
par: Montellano-Ballesteros, Juan José, et autres
Publié: (2025)

Maximising homomorphism counts between digraphs
par: Lüchtrath, Lukas, et autres
Publié: (2026)

Discreteness of asymptotic tensor ranks
par: Briët, Jop, et autres
Publié: (2023)

The Gamma-Switch Ramsey Number
par: Duffy, Christopher, et autres
Publié: (2026)

Zykov sums of digraphs with diachromatic number equal to their harmonious number
par: Olsen, Mika, et autres
Publié: (2022)

Distinguishing symmetric digraphs by proper arc-colourings of type I
par: Kalinowski, Rafał, et autres
Publié: (2025)

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

Acyclic and complete coloring of digraphs with the minimum and maximum possible numbers of colors
par: Olsen, Mika, et autres
Publié: (2025)

On distinguishing digraphs by its quasisymmetric B-polynomial
par: Narayanan, N., et autres
Publié: (2022)

Kernels in digraphs with colored vertices
par: Guevara, Mucuy-kak, et autres
Publié: (2025)

Homotopy types of Hom complexes of graph homomorphisms whose codomains are cycles
par: Fujii, Soichiro, et autres
Publié: (2024)

Deriving differential approximation results for $k\,$CSPs from combinatorial designs
par: Culus, Jean-François, et autres
Publié: (2024)

On the singularity and the inverse of 3-colored digraphs
par: Zaffer, Md Isheteyak
Publié: (2026)

Quantum Advantage and CSP Complexity
par: Ciardo, Lorenzo
Publié: (2024)

Results on three problems on isolation of graphs
par: Borg, Peter, et autres
Publié: (2026)

On the Quantum Chromatic Gap
par: Ciardo, Lorenzo
Publié: (2025)

Classical Simulation of Quantum CSP Strategies
par: Banakh, Demian, et autres
Publié: (2025)

Quantum Polymorphisms and the Complexity of Quantum Constraint Satisfaction
par: Ciardo, Lorenzo, et autres
Publié: (2025)

On coloring graphs with well-distributed edge density
par: Hassan, Syed Mujtaba, et autres
Publié: (2024)

Homotopy types of Hom complexes of graph homomorphisms whose codomains are square-free
par: Fujii, Soichiro, et autres
Publié: (2024)

Algorithmic counting of nonequivalent compact Huffman codes
par: Elsholtz, Christian, et autres
Publié: (2019)

Clique-Width: Harnessing the Power of Atoms
par: Dabrowski, Konrad K., et autres
Publié: (2020)

Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:2 (2022) #3]
par: Dourado, Mitre C., et autres
Publié: (2023)

Abstract questionnaires and FS-decision digraphs
par: Chen, Jiaye, et autres
Publié: (2025)

On the Complexity of Bipartite Degree Realizability
par: Miklós, István
Publié: (2025)

Graph polynomials: some questions on the edge
par: Farr, Graham, et autres
Publié: (2024)

A Linear Kernel for Independent Set Reconfiguration in Planar Graphs
par: Bousquet, Nicolas, et autres
Publié: (2025)

On the interval coloring impropriety of graphs
par: Carr, MacKenzie, et autres
Publié: (2023)