Proof of a conjecture concerning the direct product of bipartite graphs

DOI10.1016/j.ejc.2008.09.015zbMath1210.05123OpenAlexW2081289797WikidataQ123000497 ScholiaQ123000497MaRDI QIDQ1024310

Richard H. Hammack

Publication date: 17 June 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.09.015

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

Why mathematics needs engineering ⋮ On the construction of cospectral nonisomorphic bipartite graphs ⋮ On idomatic partitions of direct products of complete graphs ⋮ A quasicancellation property for the direct product of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the cancellation law among finite relational structures
• The Kronecker Product of Graphs
• Isomorphic components of direct products of bipartite graphs
• The $Q$-spectrum and spanning trees of tensor products of bipartite graphs

This page was built for publication: Proof of a conjecture concerning the direct product of bipartite graphs