scientific article; zbMATH DE number 166081
From MaRDI portal
Publication:4033693
Recommendations
Cited in
(18)- An edge coloring problem for graph products
- Thinness of product graphs
- Achromatic number of \(K_5\times K_n\) for large \(n\)
- scientific article; zbMATH DE number 4087684 (Why is no real title available?)
- On achromatic number of central graph of some graphs
- On the achromatic number of the Cartesian product of two complete graphs
- \(k\)-tuple chromatic number of the Cartesian product of graphs
- On acyclic colorings of direct produts
- On the achromatic number of hypercubes
- scientific article; zbMATH DE number 3843777 (Why is no real title available?)
- scientific article; zbMATH DE number 4087685 (Why is no real title available?)
- List coloring a Cartesian product with a complete bipartite factor
- Achromatic Number of K 5 × K n for Small n
- scientific article; zbMATH DE number 1824689 (Why is no real title available?)
- Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets
- The achromatic number of \(K_6\square K_7\) is 18
- Achromatic number of collections of paths and cycles
- Fall coloring on product of cycles and powers
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)