Achromatic colorings of polarity graphs
From MaRDI portal
Publication:6615554
DOI10.1016/J.FFA.2024.102497MaRDI QIDQ6615554FDOQ6615554
Authors: Vladislav Taranchuk, Craig Timmons 
Publication date: 8 October 2024
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Recommendations
Extremal problems in graph theory (05C35) Combinatorial aspects of finite geometries (05B25) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Extremal combinatorics (05D99)
Cites Work
- The nonexistence of certain generalized polygons
- Primitive flag-transitive generalized hexagons and octagons.
- Hadwiger's conjecture is true for almost every graph
- Graph colourings and partitions
- Ovoides et groupes de Suzuki
- Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
- The pseudoachromatic number of a graph
- Title not available (Why is that?)
- Polarities and \(2k\)-cycle-free graphs
- Title not available (Why is that?)
- A note on graphs without short even cycles
- Some colouring problems for Paley graphs
- Desarguesian finite generalized quadrangles are classical or dual classical
- Splits with forbidden subgraphs
- Some families of graphs, hypergraphs and digraphs defined by systems of equations: a survey
- On the minimum of the Hadwiger number for graphs with a given mean degree of vertices
- On the achromatic number of hypercubes
- Achromatic number versus pseudoachromatic number: A counterexample to a conjecture of Hedetniemi
- Partitioning the \(n\)-cube into sets with mutual distance 1
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)
