Aspects of structural combinatorics. (Graph homomorphisms and their use)
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Structure theory of algebraic structures (08A05) Algebraic structures (08A99) Embedding theorems, universal categories (18B15)
Recommendations
Cited in
(25)- On colorings of graph powers
- A surprising permanence of old motivations (a not-so-rigid story)
- On the order of countable graphs
- A note on random homomorphism from arbitrary graphs to \(\mathbb{Z}\)
- On covers of graphs
- Counting \(H-\)colorings of partial \(k-\)trees
- 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
- Distance-two labelings of graphs
- On the odd girth and the circular chromatic number of generalized Petersen graphs
- Homomorphism bounded classes of graphs
- On digraph coloring problems and treewidth duality
- Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
- A dualistic approach to bounding the chromatic number of a graph
- Folding
- On cylindrical graph construction and its applications
- Cuts and bounds
- Walk-powers and homomorphism bounds of planar signed graphs
- Many Facets of Dualities
- Colouring, constraint satisfaction, and complexity
- On endomorphism universality of sparse graph classes
- When is a random graph projective?
- The circular chromatic index of graphs of high girth
- Mixed hypergraphs and other coloring problems
- Density and power graphs in graph homomorphism problem
This page was built for publication: Aspects of structural combinatorics. (Graph homomorphisms and their use)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970083)
