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)

Full work available at URL https://doi.org/10.1007/BF01886093

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(38)

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