scientific article; zbMATH DE number 3752880
From MaRDI portal
Publication:3936766
zbMATH Open0479.05039MaRDI QIDQ3936766FDOQ3936766
Authors: Norman L. Biggs 
Publication date: 1979
Title of this publication is not available (Why is that?)
Extremal problems in graph theory (05C35) Other designs, configurations (05B30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of packing and covering (05B40)
Cited In (30)
- A note on Frucht diagrams, Boolean graphs and Hamilton cycles
- Long cycles in the middle two layers of the discrete cube
- The subconstituent algebra of an association scheme. I
- Distance-transitive representations of the symmetric groups
- Characterization of the odd graphs \(O_ k \)by parameters
- The covering radius of Hadamard codes in odd graphs
- Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph
- More odd graph theory
- On total and edge coloring some Kneser graphs
- Eigenvalue interlacing and weight parameters of graphs
- A minimum-change version of the Chung-Feller theorem for Dyck paths
- A note on the middle levels problem
- Cayley properties of the line graphs induced by consecutive layers of the hypercube
- Sparse Kneser graphs are Hamiltonian
- On geodesic transitive graphs
- Towards the Chen-Raspaud conjecture
- Kneser graphs are Hamiltonian
- More odd graph theory from another point of view
- The covering radius of doubled 2-designs in \(2O_ k\)
- On middle cube graphs
- Strong chromatic index of planar graphs with large girth
- Spectral characterization of odd graphs \(O_ k, k\leq 6\)
- How to Poison Your Mother-in-Law, and Other Caching Problems
- Bipartite Kneser graphs are Hamiltonian
- Explicit 2-factorizations of the odd graph
- Spectral bounds and distance-regularity
- On quasi-Cayley graphs
- On coloring the arcs of biregular graphs
- Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs
- Strong edge colorings of graphs and the covers of Kneser graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936766)
