The edge‐transitive but not vertex‐transitive cubic graph on 112 vertices
From MaRDI portal
Publication:5318240
DOI10.1002/jgt.20089zbMath1069.05039OpenAlexW4253479141MaRDI QIDQ5318240
No author found.
Publication date: 22 September 2005
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20089
Related Items (11)
From the Coxeter Graph to the Klein Graph ⋮ Semisymmetric elementary Abelian covers of the Möbius-Kantor graph ⋮ Semisymmetric graphs from polytopes ⋮ Links between two semisymmetric graphs on 112 vertices via association schemes ⋮ Edge-transitive cyclic regular covers of the Möbius-Kantor graph ⋮ Elementary abelian covers of graphs ⋮ Distance-residual subgraphs ⋮ A census of semisymmetric cubic graphs on up to 768 vertices ⋮ Some Topics in Graph Theory ⋮ New methods for finding minimum genus embeddings of graphs on orientable and non-orientable surfaces ⋮ Some computational aspects of solvable regular covers of graphs
Cites Work
This page was built for publication: The edge‐transitive but not vertex‐transitive cubic graph on 112 vertices
