scientific article; zbMATH DE number 2117181

Publication date: 19 November 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

textbook product retraction core directed graph retract circular coloring rigid graph

Combinatorics of partially ordered sets (06A07) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (only showing first 100 items - show all)

Adjacency preservers on invertible Hermitian matrices. I. ⋮ The quest for a characterization of hom-properties of finite character ⋮ In praise of homomorphisms ⋮ Homomorphisms and colourings of oriented graphs: an updated survey ⋮ Neighborhood complexes of some exponential graphs ⋮ Computing role assignments of split graphs ⋮ Hard constraint satisfaction problems have hard gaps at location 1 ⋮ The complexity of weighted Boolean \#CSP with mixed signs ⋮ Nerve complexes of circular arcs ⋮ Oriented vertex and arc colorings of outerplanar graphs ⋮ Counting \(4 \times 4\) matrix partitions of graphs ⋮ Computing automorphisms of semigroups. ⋮ An universality argument for graph homomorphisms ⋮ When is a random graph projective? ⋮ Minimal universal and dense minor closed classes ⋮ Semigroup theory of symmetry ⋮ Digraph matrix partitions and trigraph homomorphisms ⋮ Square-free graphs are multiplicative ⋮ Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers ⋮ List homomorphisms of graphs with bounded degrees ⋮ The structure of bi-arc trees ⋮ An almost complete description of perfect codes in direct products of cycles ⋮ Mixed hypergraphs and other coloring problems ⋮ Local properties of simplicial complexes ⋮ Homomorphisms and edge-colourings of planar graphs ⋮ Cops and robbers from a distance ⋮ Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights ⋮ Obstructions to partitions of chordal graphs ⋮ Noncommutative Riemannian geometry on graphs ⋮ Solutions and query rewriting in data exchange ⋮ Constructing uniquely realizable graphs ⋮ The fixed vertex property for graphs ⋮ An upper (lower) bound for Max (Min) CSP ⋮ Invariant measures via inverse limits of finite structures ⋮ On low tree-depth decompositions ⋮ Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms ⋮ Maltsev digraphs have a majority polymorphism ⋮ Adjacency preservers, symmetric matrices, and cores ⋮ Tension continuous maps -- their structure and applications ⋮ Synchronizing relations on words ⋮ Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs ⋮ Reflexive digraphs with near unanimity polymorphisms ⋮ Foldings in graphs and relations with simplicial complexes and posets ⋮ The complexity of surjective homomorphism problems-a survey ⋮ \(H\)-colorings of dense hypergraphs ⋮ Interleaved adjoints of directed graphs ⋮ Distinguishing graphs by their left and right homomorphism profiles ⋮ Embedding dualities for set partitions and for relational structures ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications ⋮ Colouring, constraint satisfaction, and complexity ⋮ Extending precolourings of circular cliques ⋮ Efficient algorithms for counting parameterized list \(H\)-colorings ⋮ Density and power graphs in graph homomorphism problem ⋮ On the sandpile group of the cone of a graph ⋮ Digraph functors which admit both left and right adjoints ⋮ On spaces extremal for the Gomory-Hu inequality ⋮ Minimum cost homomorphisms to semicomplete multipartite digraphs ⋮ On the restricted homomorphism problem ⋮ Hedetniemi's conjecture and adjoint functors in thin categories ⋮ Polarity of chordal graphs ⋮ On three measures of non-convexity ⋮ List H-coloring a graph by removing few vertices ⋮ All countable monoids embed into the monoid of the infinite random graph ⋮ Posets, homomorphisms and homogeneity ⋮ On wreathed lexicographic products of graphs ⋮ Homomorphisms of random paths ⋮ The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops ⋮ Bounds for visual cryptography schemes ⋮ An approximation trichotomy for Boolean \#CSP ⋮ A quasicancellation property for the direct product of graphs ⋮ Products of unit distance graphs ⋮ Oriented colorings of partial 2-trees ⋮ Acyclic 3-choosability of sparse graphs with girth at least 7 ⋮ The complexity of colouring by locally semicomplete digraphs ⋮ The complexity of locally injective homomorphisms ⋮ Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles ⋮ Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms ⋮ Acyclic 4-choosability of planar graphs without adjacent short cycles ⋮ Computing vertex-surjective homomorphisms to partially reflexive trees ⋮ The homomorphism lattice induced by a finite algebra ⋮ Hom complexes and homotopy theory in the category of graphs ⋮ Homotopy groups of Hom complexes of graphs ⋮ Dichotomy for bounded degree \(H\)-colouring ⋮ Fall colouring of bipartite graphs and Cartesian products of graphs ⋮ Universality of intervals of line graph order ⋮ Connected obstructions to full graph homomorphisms ⋮ On the subgraph epimorphism problem ⋮ \(H\)-coloring degree-bounded (acyclic) digraphs ⋮ Proof of a conjecture concerning the direct product of bipartite graphs ⋮ An oriented coloring of planar graphs with girth at least five ⋮ Finite dualities and map-critical graphs on a fixed surface ⋮ Complexity of planar signed graph homomorphisms to cycles ⋮ A more general theory of static approximations for conjunctive queries ⋮ Homomorphisms of sparse signed graphs ⋮ Realisability problem in arrow categories ⋮ On cylindrical graph construction and its applications ⋮ Quantum homomorphisms ⋮ Distance constraint satisfaction problems ⋮ \(H\)-coloring dichotomy revisited ⋮ List matrix partitions of chordal graphs

This page was built for publication: