scientific article

zbMath0479.05039MaRDI QIDQ3936766

Norman L. Biggs

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

symmetriesindependent setscodes

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Other designs, configurations (05B30) Combinatorial aspects of packing and covering (05B40)

Related Items (30)

Distance-transitive representations of the symmetric groups ⋮ Spectral characterization of odd graphs \(O_ k, k\leq 6\) ⋮ A note on the middle levels problem ⋮ On quasi-Cayley graphs ⋮ On total and edge coloring some Kneser graphs ⋮ Long cycles in the middle two layers of the discrete cube ⋮ More odd graph theory from another point of view ⋮ Strong edge colorings of graphs and the covers of Kneser graphs ⋮ More odd graph theory ⋮ How to Poison Your Mother-in-Law, and Other Caching Problems ⋮ Towards the Chen-Raspaud conjecture ⋮ Bipartite Kneser graphs are Hamiltonian ⋮ Characterization of the odd graphs \(O_ k \)by parameters ⋮ Strong chromatic index of planar graphs with large girth ⋮ Kneser graphs are Hamiltonian ⋮ On geodesic transitive graphs ⋮ The covering radius of doubled 2-designs in \(2O_ k\) ⋮ A note on Frucht diagrams, Boolean graphs and Hamilton cycles ⋮ The subconstituent algebra of an association scheme. I ⋮ Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs ⋮ The covering radius of Hadamard codes in odd graphs ⋮ Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph ⋮ Explicit 2-factorizations of the odd graph ⋮ Spectral bounds and distance-regularity ⋮ Cayley properties of the line graphs induced by consecutive layers of the hypercube ⋮ A minimum-change version of the Chung-Feller theorem for Dyck paths ⋮ On coloring the arcs of biregular graphs ⋮ Eigenvalue interlacing and weight parameters of graphs ⋮ Sparse Kneser graphs are Hamiltonian ⋮ On Middle Cube Graphs

This page was built for publication: