scientific article; zbMATH DE number 2117181
From MaRDI portal
Publication:4828516
zbMATH Open1062.05139MaRDI QIDQ4828516FDOQ4828516
Authors: J. Nešetřil, Pavol Hell 
Publication date: 19 November 2004
Title of this publication is not available (Why is that?)
Recommendations
- Graph homomorphisms
- scientific article; zbMATH DE number 93767
- scientific article; zbMATH DE number 861321
- Homomorphism theorems for graphs
- Homomorphism-homogeneous graphs
- scientific article; zbMATH DE number 1054727
- Homology theory of graphs
- Graphs of morphisms of graphs
- Graphs of morphisms of graphs
- Complexes of graph homomorphisms
Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62) Combinatorics of partially ordered sets (06A07) Graph theory (05C99)
Cited In (only showing first 100 items - show all)
- Labeled posets are universal
- Constructing uniquely realizable graphs
- On cylindrical graph construction and its applications
- Quantum homomorphisms
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
- Matrix partitions of perfect graphs
- On realizations of point determining graphs, and obstructions to full homomorphisms
- Graph partitions with prescribed patterns
- The complexity of surjective homomorphism problems-a survey
- Dismantlability of weakly systolic complexes and applications
- Adjacency preservers on invertible Hermitian matrices. I.
- The quest for a characterization of hom-properties of finite character
- Adjacency preservers, symmetric matrices, and cores
- Products of unit distance graphs
- Colouring, constraint satisfaction, and complexity
- Perfect codes in direct products of cycles
- Generalized symmetry of graphs - a survey
- On the complexity of \(H\)-colouring planar graphs
- The complexity of weighted Boolean \#CSP with mixed signs
- Homomorphisms and colourings of oriented graphs: an updated survey
- Neighborhood complexes of some exponential graphs
- The capture time of a graph
- Foldings in graphs and relations with simplicial complexes and posets
- An algorithm for the number of path homomorphisms
- Computing role assignments of split graphs
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights
- An approximation trichotomy for Boolean \#CSP
- Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
- Oriented vertex and arc colorings of outerplanar graphs
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
- Hom complexes and homotopy theory in the category of graphs
- An oriented coloring of planar graphs with girth at least five
- Oriented colorings of partial 2-trees
- On colorings of graph powers
- Aspects of structural combinatorics. (Graph homomorphisms and their use)
- Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs
- Mixed hypergraphs and other coloring problems
- Nerve complexes of circular arcs
- Counting \(4 \times 4\) matrix partitions of graphs
- A generalization of the Erdős-Ko-Rado theorem
- Locally constrained graph homomorphisms and equitable partitions
- Majority constraints have bounded pathwidth duality
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- An universality argument for graph homomorphisms
- Maltsev digraphs have a majority polymorphism
- Distinguishing graphs by their left and right homomorphism profiles
- Posets, homomorphisms and homogeneity
- The rank of connection matrices and the dimension of graph algebras
- Homomorphisms of sparse signed graphs
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- First order properties on nowhere dense structures
- \(H\)-coloring dichotomy revisited
- Tree-depth, subgraph coloring and homomorphism bounds
- Semigroup theory of symmetry
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
- On the sandpile group of the cone of a graph
- Cuts and bounds
- Adjusted interval digraphs
- Reflexive digraphs with near unanimity polymorphisms
- Universality of intervals of line graph order
- Title not available (Why is that?)
- An upper (lower) bound for Max (Min) CSP
- Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers
- Square-free graphs are multiplicative
- The complexity of colouring by locally semicomplete digraphs
- Digraph matrix partitions and trigraph homomorphisms
- Colorful subgraphs in Kneser-like graphs
- Double graphs
- Cops and robbers from a distance
- Folding
- On wreathed lexicographic products of graphs
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- Hard constraint satisfaction problems have hard gaps at location 1
- On the adaptable chromatic number of graphs
- Local properties of simplicial complexes
- Structural Properties of Sparse Graphs
- Obstructions to partitions of chordal graphs
- Oriented vertex and arc colorings of partial 2-trees
- The graph matching problem
- Noncommutative Riemannian geometry on graphs
- Solutions and query rewriting in data exchange
- List matrix partitions of chordal graphs
- Kirszbraun-type theorems for graphs
- Homomorphisms of 2-edge-colored graphs
- Almost all graphs are rigid-revisited
- Hedetniemi's conjecture and adjoint functors in thin categories
- Finite duality for some minor closed classes
- On Finite Maximal Antichains in the Homomorphism Order
- Title not available (Why is that?)
- The fixed point property for ordered sets
- CSP dichotomy for special triads
- Title not available (Why is that?)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes
- On prisms, Möbius ladders and the cycle space of dense graphs
- The complexity of locally injective homomorphisms
- Convex circuit-free coloration of an oriented graph
- Tension continuous maps -- their structure and applications
- Graph homomorphisms, the tutte polynomial and ``\(q\)-state Potts uniqueness
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
- Complexity of \(C_k\)-coloring in hereditary classes of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828516)
