Achromatic numbers and graph operations
From MaRDI portal
Publication:1201263
DOI10.1016/0012-365X(92)90683-7zbMATH Open0760.05040OpenAlexW2027719300MaRDI QIDQ1201263FDOQ1201263
Authors: Pavol Hell, Donald J. Miller
Publication date: 17 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)90683-7
Recommendations
- scientific article; zbMATH DE number 3851129
- Achromatic numbers for circulant graphs and digraphs
- Concerning the achromatic number of graphs
- scientific article; zbMATH DE number 3882457
- Achromonious graphs
- The achromatic colouring of graphs
- Chromatic numbers in some graphs
- Achromatic numbers of Kneser graphs
- scientific article; zbMATH DE number 1088659
- scientific article; zbMATH DE number 25546
Cites Work
- On multiplicative graphs and the product conjecture
- Title not available (Why is that?)
- Graph with given achromatic number
- On the chromatic number of the product of graphs
- The chromatic number of the product of two 4-chromatic graphs is 4
- A lower estimate for the achromatic number of irreducible graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- Thinness of product graphs
- Achromatic number of \(K_5\times K_n\) for large \(n\)
- On the achromatic number of the Cartesian product of two complete graphs
- Chromatic capacity and graph operations
- On the achromatic number of hypercubes
- On the oriented achromatic number of graphs
- Title not available (Why is that?)
- The achromatic number of the union of paths
This page was built for publication: Achromatic numbers and graph operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201263)