Applications of product colouring
From MaRDI portal
Publication:4046069
DOI10.1007/BF01886093zbMath0294.05108MaRDI QIDQ4046069
No author found.
Publication date: 1974
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items
Some properties on the tensor product of graphs obtained by monogenic semigroups, Topology and Adjunction in Promise Constraint Satisfaction, Subgraphs of colour-critical graphs, On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs, On constructive methods in the theory of colour-critical graphs, Vertex isoperimetry and independent set stability for tensor powers of cliques, Dualities and dual pairs in Heyting algebras, Coloring graph products---a survey, Maximum independent sets in direct products of cycles or trees with arbitrary graphs, On a product dimension of graphs, Vector coloring the categorical product of graphs, Robust Factorizations and Colorings of Tensor Graphs, KKL's influence on me, Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation, Non-trivially intersecting multi-part families, Unnamed Item, On 3-colorings of direct products of graphs, Randomly colouring graphs (a combinatorial view), Colouring, constraint satisfaction, and complexity, On sparse graphs with given colorings and homomorphisms., Fourier analysis and large independent sets in powers of complete graphs, On robust colorings of Hamming-distance graphs, Set colourings of graphs. (Reprint), On graph fall-coloring: existence and constructions, Set colourings of graphs, Maximum stable sets in analogs of Kneser and complete graphs, High-girth cubic graphs are homomorphic to the Clebsch graph, Stable sets of maximal size in Kneser-type graphs, Nearly bipartite graphs with large chromatic number, Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs, Logical compactness and constraint satisfaction problems, Projectivity and independent sets in powers of graphs
Cites Work
