Achromatic colorings of polarity graphs
From MaRDI portal
Publication:6615554
Recommendations
Cites work
- scientific article; zbMATH DE number 1088659 (Why is no real title available?)
- scientific article; zbMATH DE number 1495914 (Why is no real title available?)
- A note on graphs without short even cycles
- Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi
- Desarguesian finite generalized quadrangles are classical or dual classical
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- Graph colourings and partitions
- Hadwiger's conjecture is true for almost every graph
- On the achromatic number of hypercubes
- On the minimum of the Hadwiger number for graphs with a given mean degree of vertices
- Ovoides et groupes de Suzuki
- Partitioning the \(n\)-cube into sets with mutual distance 1
- Polarities and \(2k\)-cycle-free graphs
- Primitive flag-transitive generalized hexagons and octagons.
- Some colouring problems for Paley graphs
- Some families of graphs, hypergraphs and digraphs defined by systems of equations: a survey
- Splits with forbidden subgraphs
- The nonexistence of certain generalized polygons
- The pseudoachromatic number of a graph
This page was built for publication: Achromatic colorings of polarity graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615554)