scientific article; zbMATH DE number 1054727
As the authors write, this paper is the first part of an introduction to the subject of graph homomorphism in the mixed form of a course and a survey. To inform a reader about this paper it will be suitable to list its chapters and topics. It has six chapters. The first chapter is ``Introduction. The second chapter ``Basics has the following items: Basic definitions, Quotients, Retracts, Cores, Homomorphic equivalence, Products. The third chapter ``Vertex-transitive graphs has the themes: Cayley graphs, Independence ratio and the no-homomorphism lemma, Cores of vertex-transitive graphs, Kneser graphs, Circular graphs. The fourt chapter ``Graph colourings and variations has the subjects: Chromatic number, Achromatic number, Kneser colourings, Circular colourings, Fractional chromatic number, Chromatic difference sequence, Ultimate independence ratio. The fifth chapter ``Graph products has the sections: The categorial product and Hedetniemi's conjecture, The Cartesian product and normal Cayley graphs, The strong product and the lexicographic product, Isometric embeddings and retracts. The sixth chapter is very short and is called ``Remarks. For the entire collection see [Zbl 0868.00039].
- A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
- On colorings of graph powers
- Generalized symmetry of graphs - a survey
- The capture time of a graph
- Fractional multiples of graphs and the density of vertex-transitive graphs
- Homomorphisms and amalgamation
- Endomorphisms and cores of quadratic forms graphs in odd characteristic
- Sabidussi versus Hedetniemi for three variations of the chromatic number
- Cores and independence numbers of Grassmann graphs
- Retractions and homomorphisms on some operations of graphs
- On retracts, absolute retracts, and foldings in cographs
- De Bruijn and Kautz digraphs of a rooted tree
- Homomorphisms of hexagonal graphs to odd cycles
- Cores of vertex transitive graphs
- Endomorphisms of quadratic forms graph in characteristic two
- Coloring graphs by translates in the circle
- Equitable distinguishing chromatic number
- The chromatic number of the product of 14-chromatic graphs can be 13
- Cores of cubelike graphs
- On the fold thickness of graphs
- On Motzkin's problem in the circle group
- Graph-FCA: an extension of formal concept analysis to knowledge graphs
- Pell graphs
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- Endomorphisms of twisted Grassmann graphs
- Graph homomorphisms via vector colorings
- Logical argumentation by dynamic proof systems
- Double graphs
- Independence and coloring properties of direct products of some vertex-transitive graphs
- Homomorphisms of binary Cayley graphs
- Quantum graph homomorphisms via operator systems
- Quantum homomorphisms
- Multiplicative graphs and semi-lattice endomorphisms in the category of graphs
- Restricted trees: simplifying networks with bottlenecks
- On the circular altitude of graphs
- Homomorphisms and colourings of oriented graphs: an updated survey
- Structural homeomorphism between structural descriptors and relation between corresponding structures: a mathematical picture
- Graph information ratio
- Graphs of BCI/BCK-algebras
- On endomorphisms of alternating forms graph
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- scientific article; zbMATH DE number 861321 (Why is no real title available?)
- On the spectrum of a class of distance-transitive graphs
- Conceptual Navigation in Large Knowledge Graphs
- Ideal-based quasi zero divisor graph
- On Minkowski space and finite geometry
- Retracting Graphs to Cycles
- scientific article; zbMATH DE number 7268038 (Why is no real title available?)
- scientific article; zbMATH DE number 7297854 (Why is no real title available?)
- Shifts of the stable Kneser graphs and hom-idempotence
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices
- On unretractive graphs
- On unretractive graphs
- Uniform emulations of Cartesian-product and Cayley graphs
- Sparsification lower bounds for list \(H\)-coloring
- The core of a complementary prism
- Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$
- The core of a vertex-transitive complementary prism
- Bounds on the Twin-Width of Product Graphs
- Braid graphs in simply-laced triangle-free Coxeter systems are partial cubes
- The core of a vertex transitive complementary prism of a lexicographic product
- Cores of geometric graphs
- Forbiddance and capacity
- Formal concept analysis: from knowledge discovery to knowledge processing
- Creating a network-state homomorphism through optimization
- Theoretical comparison of relational concept analysis (RCA) and graph-FCA (GCA)
- Sparsification lower bounds for list H-coloring
- Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds
- The folded map on an identification graph and its application
- Categories of impartial rulegraphs and gamegraphs
- The complexity of homomorphism reconstructibility
- List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs
- Homomorphisms of (n,m)-graphs with respect to generalised switch
- Graph homomorphisms and nodal domains
- Density and power graphs in graph homomorphism problem
- On wreathed lexicographic products of graphs
- Idomatic partitions of direct products of complete graphs
- Uniquely pairable graphs
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 Q4352272)
