On Tetravalent Graphs
From MaRDI portal
Cited in
(11)- Distance-transitive graphs and generalized polygons
- Distance-transitive representations of the symmetric groups
- The diameter of bipartite distance-regular graphs
- There are only finitely many finite distance-transitive graphs of given valency greater than two
- Distance-regular graphs and (s,c,a,k)-graphs
- On bipartite tetra0alent graphs
- Bounding the diameter of a distance-transitive graph
- Distance-transitive graphs of valency five
- On geodesic transitive graphs
- Distance-transitive graphs of valency 5, 6 and 7
- An overview on vertex stabilizers in vertex-transitive graphs
This page was built for publication: On Tetravalent Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5672933)