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)
- 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
- 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
- Iterated arc graphs.
- Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs
- \(H\)-colorings of dense hypergraphs
- The complexity of tropical graph homomorphisms
- The homomorphism lattice induced by a finite algebra
- Homomorphisms and edge-colourings of planar graphs
- Matrix Partitions with Finitely Many Obstructions
- Density and power graphs in graph homomorphism problem
- Conjugation in semigroups.
- The complexity of signed graph and edge-coloured graph homomorphisms
- The complexity of counting surjective homomorphisms and compactions
- Minimum Cost Homomorphisms to Reflexive Digraphs
- Lower bounds for the graph homomorphism problem
- Polarity of chordal graphs
- On spaces extremal for the Gomory-Hu inequality
- An almost complete description of perfect codes in direct products of cycles
- Morphisms for resistive electrical networks
- Almost all graphs are rigid - Revisited
- List homomorphisms of graphs with bounded degrees
- A combinatorial constraint satisfaction problem dichotomy classification conjecture
- Semantic acyclicity on graph databases
- On the circular altitude of graphs
- Embedding dualities for set partitions and for relational structures
- Efficient algorithms for counting parameterized list \(H\)-colorings
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
- Acyclic 4-choosability of planar graphs without adjacent short cycles
- Counting homomorphisms to sparse graphs
- Digraph functors which admit both left and right adjoints
- Growth rates of permutation grid classes, tours on graphs, and the spectral radius
- On tension-continuous mappings
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)