Publication:3544770

From MaRDI portal
Revision as of 01:58, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


zbMath1164.05348MaRDI QIDQ3544770

Dmitry G. Fon-Der-Flaass

Publication date: 8 December 2008

Full work available at URL: https://eudml.org/doc/55580


05C15: Coloring of graphs and hypergraphs


Related Items

Unnamed Item, On Perfect 2‐Colorings of Johnson Graphs J(v, 3), Unnamed Item, Unnamed Item, Perfect colorings of regular graphs, Unnamed Item, Perfect 3-colorings of the cubic graphs of order 10, Perfect 2-colorings of the generalized Petersen graph GP(n,3), Perfect 2-colorings of the cubic graphs of order less than or equal to 10, Harmonic Distributions for Equitable Partitions of a Hypercube, On completely regular codes, Unnamed Item, Perfect 2-colorings of the generalized Petersen graph, Cardinality spectra of components of correlation immune functions, bent functions, perfect colorings, and codes, On perfect 2-colorings of the \(q\)-ary \(n\)-cube, On calculation of the interweight distribution of an equitable partition, On periodicity of perfect colorings of the infinite hexagonal and triangular grids, On weight distributions of perfect colorings and completely regular codes, Local duality for equitable partitions of a Hamming space, On the regularity of perfect 2-colorings of the Johnson graph, Distance-2 MDS codes and Latin colorings in the Doob graphs, On the non-existence of extended 1-perfect codes and MDS codes, Completely regular codes in Johnson and Grassmann graphs with small covering radii, Subgroup regular sets in Cayley graphs, Perfect 2-coloring of the quartic graphs with order at most 8, The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances, Equitable 2-partitions of the Hamming graphs with the second eigenvalue, Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs, Algebraic properties of perfect structures, On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays, On completely regular and completely transitive supplementary codes, On unbalanced Boolean functions with best correlation immunity, Perfect 3-colorings on 6-regular graphs of order 9, On transitive uniform partitions of \(F^n\) into binary Hamming codes, New families of completely regular codes and their corresponding distance regular coset graphs, Degree 2 Boolean functions on Grassmann graphs