Applications of product colouring

DOI10.1007/BF01886093MaRDI QIDQ4046069zbMATH OpenFDO

Authors

Publication date 1974

Published in Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Cites work

• Graph Theory and Probability. II
• On uniquely colorable planar graphs

Cited in

(35)

• Coloring graph products---a survey
• Bounds on the Twin-Width of Product Graphs
• On robust colorings of Hamming-distance graphs
• Some properties on the tensor product of graphs obtained by monogenic semigroups
• scientific article; zbMATH DE number 7687430 (Why is no real title available?)
• Colouring, constraint satisfaction, and complexity
• A note on acyclic coloring of strong product of graphs
• Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation
• Vertex isoperimetry and independent set stability for tensor powers of cliques
• Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
• Randomly colouring graphs (a combinatorial view)
• On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
• Dualities and dual pairs in Heyting algebras
• Topology and Adjunction in Promise Constraint Satisfaction
• Stable sets of maximal size in Kneser-type graphs
• Set colourings of graphs. (Reprint)
• Maximum independent sets in direct products of cycles or trees with arbitrary graphs
• Maximum stable sets in analogs of Kneser and complete graphs
• Robust Factorizations and Colorings of Tensor Graphs
• KKL's influence on me
• On the maximum number of edges in \(k\)-critical graphs
• On constructive methods in the theory of colour-critical graphs
• On graph fall-coloring: existence and constructions
• On sparse graphs with given colorings and homomorphisms.
• Set colourings of graphs
• Subgraphs of colour-critical graphs
• Projectivity and independent sets in powers of graphs
• Logical compactness and constraint satisfaction problems
• Vector coloring the categorical product of graphs
• High-girth cubic graphs are homomorphic to the Clebsch graph
• On a product dimension of graphs
• Non-trivially intersecting multi-part families
• Nearly bipartite graphs with large chromatic number
• Fourier analysis and large independent sets in powers of complete graphs
• On 3-colorings of direct products of graphs

This page was built for publication: Applications of product colouring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4046069)