The level of nonmultiplicativity of graphs

DOI10.1016/S0012-365X(01)00102-9MaRDI QIDQ1349114zbMATH OpenOpenAlexFDO

Authors Claude Tardif, Xuding Zhu

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

factorizationHedetniemi's conjectureKneser graphs

Mathematics Subject Classification ID

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

Recommendations

• An intrinsic nontriviality of graphs
• Multiplicities of subgraphs
• On non-denumerable graphs
• On graphs with an eigenvalue of maximal multiplicity
• scientific article; zbMATH DE number 3287786
• scientific article; zbMATH DE number 4038604
• The multiplicities of eigenvalues of a graph
• On the multiplicity of the eigenvalues of a graph
• ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
• Multiplicity-free gonality on graphs

Cited in

(3)

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

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

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