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