scientific article; zbMATH DE number 166081

zbMATH Open0774.05036MaRDI QIDQ4033693FDOQ4033693

Nam-Po Chiang, Hung-Lin Fu

Publication date: 16 May 1993

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3843777
• Achromatic number of \(K_5\times K_n\) for large \(n\)
• Achromatic Number of K 5 × K n for Small n
• Achromatic numbers and graph operations
• scientific article; zbMATH DE number 994578

zbMATH Keywords

pathsboundscyclesCartesian productcomplete graphsachromatic numberfactorscomplete \(k\)-coloring

Mathematics Subject Classification ID

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

Cited In (13)

• An edge coloring problem for graph products
• Thinness of product graphs
• Achromatic number of \(K_5\times K_n\) for large \(n\)
• Title not available (Why is that?)
• The achromatic number of K_{6} □ K_{7} is 18
• On the achromatic number of the Cartesian product of two complete graphs
• On acyclic colorings of direct produts
• On the achromatic number of hypercubes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Achromatic Number of K 5 × K n for Small n
• Title not available (Why is that?)
• Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets

This page was built for publication:

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