On the packing chromatic number of Moore graphs

DOI10.1016/j.dam.2020.10.009zbMath1454.05038arXiv1909.11638OpenAlexW3094297827MaRDI QIDQ2217471

Diego González-Moreno, Julián Fresán-Figueroa, Mika Olsen

Publication date: 29 December 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.11638

zbMATH Keywords

ovoidspacking chromatic numbercagesMoore graphs

Mathematics Subject Classification ID

Generalized quadrangles and generalized polygons in finite geometry (51E12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Combinatorial structures in finite projective spaces (51E20)

Related Items (2)

A characterization of 4-\(\chi_S\)-vertex-critical graphs for packing sequences with \(s_1 = 1\) and \(s_2 \geq 3\) ⋮ Special structures in \(\mathcal{Q}(4, q)\), projective planes and its application in \(L(h, k)\)-colorings of their Moore graphs

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packing chromatic number of distance graphs
• The packing chromatic number of the infinite square lattice is between 13 and 15
• Finite generalized quadrangles
• On the packing chromatic number of some lattices
• Constructions of bi-regular cages
• Generalized polygons with valuation
• Notes on complexity of packing coloring
• Packing chromatic number of cubic graphs
• On the packing chromatic number of subcubic outerplanar graphs
• Intersection pattern of the classical ovoids in symplectic 3-space of even order
• A construction of small \((q-1)\)-regular graphs of girth 8
• The packing chromatic number of hypercubes
• Dynamic cage survey
• Moore graphs and beyond: a survey of the degree/diameter problem
• Packing chromatic number of base-3 Sierpiński graphs
• On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

This page was built for publication: On the packing chromatic number of Moore graphs