Results 161 to 170 of about 514 (184)
Some of the next articles are maybe not open access.
The partial order of graphs and homomorphisms
2004Abstract This chapter considers the partial order on graphs induced by the existence of homomorphisms. This order is rich enough to represent all countable partial orders. It discusses antichains in the homomorphism order, i.e., collections of incomparable graphs (graphs without homomorphisms between any two of them).
Pavol Hell, Jaroslav Nešetřil
openaire +1 more source
Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs
SIAM Journal on Computing, 2021Paweł Rzążewski, Karolina Okrasa
exaly
Graph Homomorphism Features: Why Not Sample?
Communications in Computer and Information Science, 2022Florian Yger +2 more
exaly
Graph homomorphism reconfiguration and frozen H‐colorings
Journal of Graph Theory, 2020Mark Siggers, Jonathan A Noel
exaly
New Plain-Exponential Time Classes for Graph Homomorphism
Theory of Computing Systems, 2010Magnus Wahlstrom, Wahlstrom Magnus
exaly
Lower Bounds for the Graph Homomorphism Problem
Lecture Notes in Computer Science, 2015Alexander Kulikov +2 more
exaly
Density and power graphs in graph homomorphism problem
Discrete Mathematics, 2008Hossein Hajiabolhassan, Amir Daneshgar
exaly
Approximation Algorithms for Graph Homomorphism Problems
Lecture Notes in Computer Science, 2006Michael Langberg +2 more
exaly

