Copertina

Towards a dichotomy for the switch list homomorphism problem for signed graphs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Kim, Hyobin, Siggers, Mark
Natura:	Preprint
Pubblicazione:	2021
Soggetti:	Combinatorics 05C22 (Primary), 05C85 (Secondary)
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Recolouring Homomorphisms to triangle-free reflexive graphs
di: Lee, Jae-baek, et al.
Pubblicazione: (2021)

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

When all directed cycles have the same weight
di: Berger, Eli, et al.
Pubblicazione: (2026)

The Antisymmetric Line Graph
di: Bal, Hartosh Singh
Pubblicazione: (2026)

Coloring graphs as complete graph invariants
di: Asgarli, Shamil, et al.
Pubblicazione: (2025)

Regular bipartite decompositions of pseudorandom graphs
di: Ferber, Asaf, et al.
Pubblicazione: (2024)

Combinatorial properties of continuous graphs: A survey of challenges, solutions and open problems
di: Grigoriev, Alexander, et al.
Pubblicazione: (2025)

$5$-list-coloring toroidal $6$-regular triangulations in linear time
di: Balachandran, Niranjan, et al.
Pubblicazione: (2021)

Algorithmic releases on the spanning trees of suitable graphs
di: Imbesi, Maurizio, et al.
Pubblicazione: (2017)

Cofinality of Regular Tournaments
di: Hatem, Omar, et al.
Pubblicazione: (2026)

Reflexive Digraph Reconfiguration by Orientation Strings
di: Pullas, David Emmanuel Pazmiño, et al.
Pubblicazione: (2025)

5-Coloring Planar Graphs with a Color Class of Order at Most $|V|/6$
di: Inoue, Yuta, et al.
Pubblicazione: (2025)

Cup Stacking in Graphs
di: Fay, Paul, et al.
Pubblicazione: (2023)

Asymptotics of the Minimal Feedback Arc Set in Erdős-Rényi Graphs
di: Diamond, Harvey, et al.
Pubblicazione: (2024)

Asymptotic Lower Bounds for the Feedback Arc Set Problem in Random Graphs
di: Diamond, Harvey, et al.
Pubblicazione: (2024)

Fulkerson duality for modulus of spanning trees and partitions
di: Truong, Huy, et al.
Pubblicazione: (2023)

Matroid reinforcement and sparsification
di: Truong, Huy, et al.
Pubblicazione: (2024)

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

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
di: Koutsoutis, Alex, et al.
Pubblicazione: (2025)

Improved lower bounds for the maximum order of an induced acyclic subgraph
di: Asgarli, Shamil, et al.
Pubblicazione: (2025)

The classification of homomorphism homogeneous oriented graphs
di: Pavlica, Bojana, et al.
Pubblicazione: (2024)

Minimum number of distinct eigenvalues of distance-regular and signed Johnson graphs
di: Fallat, Shaun, et al.
Pubblicazione: (2024)

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

COVID on trees and infinite grids
di: Barnett, Andrea, et al.
Pubblicazione: (2024)

Lower Bounds for the Pfaffian Number of Graphs
di: Junchaya, Enrique, et al.
Pubblicazione: (2026)

Explicit geometric construction of Ramsey graphs
di: Kocbek, Matija
Pubblicazione: (2025)

4-cop-win graphs have at least 19 vertices
di: Turcotte, Jérémie, et al.
Pubblicazione: (2020)

Tree-independence number VI. Thetas and pyramids
di: Chudnovsky, Maria, et al.
Pubblicazione: (2025)

Cobiased graphs: Single-element extensions and elementary quotients of graphic matroids
di: Slilaty, Daniel, et al.
Pubblicazione: (2024)

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

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

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

Optimally reconnecting graphs against an edge-destroying adversary
di: McDonald, Daniel C.
Pubblicazione: (2021)

A very short proof of Sidorenko's inequality for counts of homomorphism between graphs
di: Lüchtrath, Lukas, et al.
Pubblicazione: (2024)

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

On the Extremal Energy of Complex Unit Gain Dumbbell Graphs
di: Huang, Silin, et al.
Pubblicazione: (2026)

Generating maps on oriented surfaces using the homomorphism principle
di: Brinkmann, Gunnar
Pubblicazione: (2024)

The spread of fire on a random multigraph
di: Goldschmidt, Christina, et al.
Pubblicazione: (2017)

First Order Logic and Twin-Width in Tournaments and Dense Oriented Graphs
di: Geniet, Colin, et al.
Pubblicazione: (2022)

Splitting a graph by a given partition of the set of vertices based on the minimum weight of the induced trees
di: Buslov, V. A.
Pubblicazione: (2025)