The Gray graph revisited
From MaRDI portal
Publication:4508617
DOI<1::AID-JGT1>3.0.CO;2-7 10.1002/1097-0118(200009)35:1<1::AID-JGT1>3.0.CO;2-7zbMath1021.05049OpenAlexW4244365487MaRDI QIDQ4508617
Tomaž Pisanski, Dragan Marušič
Publication date: 14 January 2001
Full work available at URL: https://doi.org/10.1002/1097-0118(200009)35:1<1::aid-jgt1>3.0.co;2-7
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45)
Related Items (10)
Semisymmetric graphs from polytopes ⋮ Semisymmetric graphs of order twice prime powers with the same prime valency ⋮ A worthy family of semisymmetric graphs ⋮ Links between two semisymmetric graphs on 112 vertices via association schemes ⋮ An infinite family of semisymmetric graphs constructed from affine geometries ⋮ Cubic edge-transitive graphs of order 2\(p^{3}\) ⋮ The genus of the Gray graph is 7 ⋮ Distance-residual subgraphs ⋮ A census of semisymmetric cubic graphs on up to 768 vertices ⋮ An infinite family of cubic edge- but not vertex-transitive graphs
Cites Work
This page was built for publication: The Gray graph revisited
