The level of nonmultiplicativity of graphs

DOI10.1016/S0012-365X(01)00102-9zbMath0995.05062OpenAlexW2059892291MaRDI QIDQ1349114

Xuding Zhu, Claude Tardif

Publication date: 21 May 2002

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00102-9

zbMATH Keywords

factorizationKneser graphsHedetniemi's conjecture

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Shannon capacity and the categorical product ⋮ On inverse powers of graphs and topological implications of Hedetniemi's conjecture ⋮ Counterexamples to Hedetniemi's conjecture and infinite Boolean lattices

This page was built for publication: The level of nonmultiplicativity of graphs