The achromatic number of Kneser graphs
From MaRDI portal
Publication:510596
DOI10.1016/J.ENDM.2016.09.044zbMATH Open1440.05097OpenAlexW2536615738MaRDI QIDQ510596FDOQ510596
Christian Rubio-Montiel, G. Araujo-Pardo, Juan Carlos Díaz-Patiño
Publication date: 13 February 2017
Full work available at URL: https://doi.org/10.1016/j.endm.2016.09.044
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Triple systems (05B07)
Cites Work
- Kneser's conjecture, chromatic number, and homotopy
- On Sets of Distances of n Points
- The b-chromatic number of a graph
- On the chromatic number of some geometric type Kneser graphs
- Geometric achromatic and pseudoachromatic indices
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the b-chromatic number of Kneser graphs
Cited In (7)
- Achromatic number of \(K_5\times K_n\) for large \(n\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Achromatic number and facial achromatic number of connected locally-connected graphs
- Achromatic numbers of Kneser graphs
- On the chromatic number of some geometric type Kneser graphs
- The Hadwiger number, chordal graphs and \(ab\)-perfection
This page was built for publication: The achromatic number of Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510596)
