Zobrazeno 1 - 10
of 131
pro vyhledávání: '"Feder, Tomas"'
The complexity of the list homomorphism problem for signed graphs appears difficult to classify. Existing results focus on special classes of signed graphs, such as trees and reflexive signed graphs. Irreflexive signed graphs are in a certain sense t
Externí odkaz:
http://arxiv.org/abs/2306.06449
Publikováno v:
Fundamenta Informaticae, Volume 188, Issue 1 (December 15, 2022) fi:10437
In this paper, we deal with hamiltonicity in planar cubic graphs G having a facial 2-factor Q via (quasi) spanning trees of faces in G/Q and study the algorithmic complexity of finding such (quasi) spanning trees of faces. Moreover, we show that if B
Externí odkaz:
http://arxiv.org/abs/2212.02668
Publikováno v:
In Theoretical Computer Science 27 June 2024 1001
We consider the problem of finding a homomorphism from an input digraph $G$ to a fixed digraph $H$. We show that if $H$ admits a weak near unanimity polymorphism $\phi$ then deciding whether $G$ admits a homomorphism to $H$ (HOM($H$)) is polynomial-t
Externí odkaz:
http://arxiv.org/abs/2009.13090
We consider homomorphisms of signed graphs from a computational perspective. In particular, we study the list homomorphism problem seeking a homomorphism of an input signed graph $(G,\sigma)$, equipped with lists $L(v) \subseteq V(H), v \in V(G)$, of
Externí odkaz:
http://arxiv.org/abs/2005.05547
Publikováno v:
In Discrete Mathematics March 2023 346(3)
Barnette identified two interesting classes of cubic polyhedral graphs for which he conjectured the existence of a Hamiltonian cycle. Goodey proved the conjecture for the intersection of the two classes. We examine these classes from the point of vie
Externí odkaz:
http://arxiv.org/abs/1807.01410
It is a well-known fact that hamiltonicity in planar cubic graphs is an NP-complete problem. This implies that the existence of an A-trail in plane eulerian graphs is also an NP-complete problem even if restricted to planar 3-connected eulerian graph
Externí odkaz:
http://arxiv.org/abs/1806.06713
We study the existence of hamiltonian cycles in plane cubic graphs G having a facial 2-factor Q. Thus hamiltonicity in G is transformed into the existence of a (quasi) spanning tree of faces in the contraction G/Q. In particular, we study the case wh
Externí odkaz:
http://arxiv.org/abs/1806.05483
Autor:
Feder, Tomas, Hell, Pavol
Correspondence homomorphisms are both a generalization of standard homomorphisms and a generalization of correspondence colourings. For a fixed target graph $H$, the problem is to decide whether an input graph $G$, with each edge labeled by a pair of
Externí odkaz:
http://arxiv.org/abs/1703.05881