On bipartite tetra0alent graphs
From MaRDI portal
Publication:1846433
DOI10.1016/0012-365X(74)90029-6zbMath0288.05117MaRDI QIDQ1846433
Publication date: 1974
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Distance-transitive representations of the symmetric groups, Distance-transitive graphs of valency five, On distance-regular graphs with height two. II, The diameter of bipartite distance-regular graphs, Distance-transitive graphs of valency 5, 6 and 7, On distance-regular graphs with fixed valency, There are only finitely many finite distance-transitive graphs of given valency greater than two
Cites Work
- The roots of combinatorics
- On the structure of generalized quadrangles
- Distance-Transitive Graphs of Valency Four
- Minimal Regular Graphs of Girths Eight and Twelve
- Regular d-valent graphs of girth 6 and 2(d2−d+1) vertices
- On Trivalent Graphs
- PRIMITIVE AND IMPRIMITIVE GRAPHS
- On Tetravalent Graphs
- ARC TRANSITIVITY IN GRAPHS
