Graph products and the chromatic difference sequence of vertex-transitive graphs

DOI10.1016/S0012-365X(97)00171-4zbMath0955.05044MaRDI QIDQ1584242

Claude Tardif

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

circulantsvertex-transitive graphschromatic difference sequences

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

Structure of independent sets in direct products of some vertex-transitive graphs ⋮ Maximum independent sets in direct products of cycles or trees with arbitrary graphs ⋮ Independent sets in direct products of vertex-transitive graphs ⋮ Intersecting Families in Symmetric Unions of Direct Products of Set Families ⋮ Non-trivially intersecting multi-part families ⋮ The fractional version of Hedetniemi's conjecture is true ⋮ The \(k\)-independence number of direct products of graphs and Hedetniemi's conjecture ⋮ Independent sets in tensor products of three vertex-transitive graphs ⋮ Primitivity and independent sets in direct products of vertex-transitive graphs ⋮ Independence and coloring properties of direct products of some vertex-transitive graphs

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• The chromatic difference sequence of the Cartesian product of graphs
• Extremal problems concerning Kneser-graphs
• Homomorphisms of 3-chromatic graphs
• n-tuple colorings and associated graphs
• The chromatic number and other functions of the lexicographic product
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Circulants and Sequences
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph products and the chromatic difference sequence of vertex-transitive graphs