Aspects of structural combinatorics. (Graph homomorphisms and their use)

DOI10.11650/twjm/1500407157zbMath0939.05001OpenAlexW1876230081MaRDI QIDQ1970083

Jaroslav Nešetřil

Publication date: 5 July 2000

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500407157

zbMATH Keywords

algorithmcategorystructure theoremsgraph homomorphismpartially ordered setcoloring

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Structure theory of algebraic structures (08A05) Embedding theorems, universal categories (18B15) Algebraic structures (08A99)

Related Items (24)

On the odd girth and the circular chromatic number of generalized Petersen graphs ⋮ Homomorphism bounded classes of graphs ⋮ Walk-powers and homomorphism bounds of planar signed graphs ⋮ When is a random graph projective? ⋮ The circular chromatic index of graphs of high girth ⋮ Mixed hypergraphs and other coloring problems ⋮ On digraph coloring problems and treewidth duality ⋮ Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities ⋮ On the order of countable graphs ⋮ Many Facets of Dualities ⋮ A note on random homomorphism from arbitrary graphs to \(\mathbb{Z}\) ⋮ On covers of graphs ⋮ Colouring, constraint satisfaction, and complexity ⋮ Density and power graphs in graph homomorphism problem ⋮ A dualistic approach to bounding the chromatic number of a graph ⋮ Random cubic graphs are not homomorphic to the cycle of size 7 ⋮ Universal partial order represented by means of oriented trees and other simple graphs ⋮ Folding ⋮ On colorings of graph powers ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ Cuts and bounds ⋮ Counting \(H-\)colorings of partial \(k-\)trees ⋮ On cylindrical graph construction and its applications ⋮ Distance-two labelings of graphs

This page was built for publication: Aspects of structural combinatorics. (Graph homomorphisms and their use)