scientific article; zbMATH DE number 2117181

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

zbMATH Keywords

coreproductdirected graphretractiontextbookretractcircular coloringrigid graph

Mathematics Subject Classification ID

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)

• On maximum independent set of categorical product and ultimate categorical ratios of graphs
• On retracts, absolute retracts, and foldings in cographs
• A note on independence complexes of chordal graphs and dismantling
• Odd-angulated graphs and cancelling factors in box products
• Retractions and homomorphisms on some operations of graphs
• Orthogonal tree decompositions of graphs
• Title not available (Why is that?)
• On structure of cluster algebras of geometric type. I: In view of sub-seeds and seed homomorphisms
• The monotonicity property of \(M\)-partition problems
• Constants and finite unary relations in qualitative constraint reasoning
• Endomorphisms and cores of quadratic forms graphs in odd characteristic
• Fundamental groupoids for graphs
• Reconfiguration in bounded bandwidth and tree-depth
• Endomorphisms of quadratic forms graph in characteristic two
• The \(C_{k}\)-extended graft construction
• Binary covering arrays on tournaments
• Title not available (Why is that?)
• Homomorphism order of connected monounary algebras
• THE LATTICE OF SUPER-BELNAP LOGICS
• Towards a characterization of universal categories
• On multichromatic numbers of widely colorable graphs
• Representability of permutation representations on coalgebras and the isomorphism problem
• The analytic evolution of Dyson-Schwinger equations via homomorphism densities
• Graph information ratio
• A homotopy category for graphs
• Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems
• Relating structure and power: comonadic semantics for computational resources (extended abstract)
• On the complexity of digraph colourings and vertex arboricity
• A unified approach to structural limits and limits of graphs with bounded tree-depth
• Relating structure and power: comonadic semantics for computational resources
• Whither semantics?
• On the \(b\)-continuity of the lexicographic product of graphs
• The complexity of valued CSPs
• Peek arc consistency
• The good, the bad, and the great: homomorphisms and cores of random graphs
• NP for Combinatorialists
• On the complexity of \(\mathbb{H}\)-coloring for special oriented trees
• Gaps in full homomorphism order
• Semigroups generated by partitions
• Finite ultrametric balls
• On a certain homomorphism properties of graphs II.
• Algebra and the complexity of digraph CSPs: a survey
• On the Baer-Lovász-Tutte construction of groups from graphs: isomorphism types and homomorphism notions
• Complexity of correspondence \(H\)-colourings
• Graph homomorphisms and components of quotient graphs
• Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
• Point determining digraphs, \(\{ 0,1 \}\)-matrix partitions, and dualities in full homomorphisms
• Homomorphic preimages of geometric paths
• Exact algorithm for graph homomorphism and locally injective graph homomorphism
• Properties and morphisms of finite ultrametric spaces and their representing trees
• On rainbow-free colourings of uniform hypergraphs
• Graphs with convex balls
• 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

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)