Homomorphisms of 3-chromatic graphs
From MaRDI portal
Publication:1062066
DOI10.1016/0012-365X(85)90073-1zbMATH Open0572.05024MaRDI QIDQ1062066FDOQ1062066
Authors: Michael O. Albertson, Karen L. Collins 
Publication date: 1985
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 4008417
- On colorings of 3-homogeneous hypergraphs in 3 colors
- scientific article; zbMATH DE number 3974975
- Finite Homogeneous 3‐Graphs
- scientific article; zbMATH DE number 4208097
- The chromatically equivalence theorem of three kinds of combinatorial graphs
- Colored graph homomorphisms
- Finite 3-set-homogeneous graphs
- Absolutely 3-chromatic graphs
- Structures and chromaticity of some extremal 3-colourable graphs
Cites Work
- Inequalities: theory of majorization and its applications
- Color-families are dense
- On color-families of graphs
- Title not available (Why is that?)
- Some partitions associated with a partially ordered set
- Symmetric relations (undirected graphs) with given semigroups
- The structure of Sperner k-families
- On the complexity of the general coloring problem
- On some strongly rigid families of graphs and the full embeddings they induce
- Title not available (Why is that?)
- Colorings and interpretations: a connection between graphs and grammar forms
- The chromatic difference sequence of a graph
- Title not available (Why is that?)
- On predecessors of finite languages
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (51)
- Star-extremal graphs and the lexicographic product
- Quantum homomorphisms
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- On the intersection density of primitive groups of degree a product of two odd primes
- On maximum intersecting sets in direct and wreath product of groups
- Odd-angulated graphs and cancelling factors in box products
- The \(k\)-independence number of direct products of graphs and Hedetniemi's conjecture
- Structure of independent sets in direct products of some vertex-transitive graphs
- Circulants and Sequences
- Some star extremal circulant graphs
- Independent sets in direct products of vertex-transitive graphs
- The edge chromatic difference sequence of a cubic graph
- Cross-intersecting families and primitivity of symmetric systems
- On Motzkin's problem in the circle group
- The maximum product of sizes of cross-intersecting families
- Graph products and the chromatic difference sequence of vertex-transitive graphs
- The maximum product of weights of cross-intersecting families
- On the ultimate normalized chromatic difference sequence of a graph
- A generalization of the Erdős-Ko-Rado theorem
- Stable sets of maximal size in Kneser-type graphs
- Title not available (Why is that?)
- Maximum stable sets in analogs of Kneser and complete graphs
- The maximum sum and the maximum product of sizes of cross-intersecting families
- The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
- Chromatic difference sequences and homomorphisms
- Independent sets in tensor products of three vertex-transitive graphs
- Graph information ratio
- Independence ratios of graph powers
- On complete multipartite derangement graphs
- Inequalities with respect to graph homomorphism
- Independence and coloring properties of direct products of some vertex-transitive graphs
- Cores of imprimitive symmetric graphs of order a product of two distinct primes
- Homomorphisms of the Petersen graph and combinatorial inequalities
- Intersecting families in symmetric unions of direct products of set families
- \(k\)-tuple colorings of the Cartesian product of graphs
- Primitivity and independent sets in direct products of vertex-transitive graphs
- Projectivity and independent sets in powers of graphs
- Cross-intersecting subfamilies of levels of hereditary families
- On triangles in derangement graphs
- A sharp bound for the product of weights of cross-intersecting families
- 3-setwise intersecting families of the symmetric group
- The chromatic difference sequence of the Cartesian product of graphs. II
- On the ultimate independence ratio of a graph
- Independent sets of maximal size in tensor powers of vertex-transitive graphs
- On metric properties of maps between Hamming spaces and related graph homomorphisms
- On Minkowski space and finite geometry
- The chromatic difference sequence of the Cartesian product of graphs
- On the bounds for the ultimate independence ratio of a graph
- The circular chromatic number of hypergraphs
- Fractional multiples of graphs and the density of vertex-transitive graphs
- Independence number of products of Kneser graphs
This page was built for publication: Homomorphisms of 3-chromatic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062066)
