Graphs with Maximal Even Girth
From MaRDI portal
Publication:5573120
DOI10.4153/CJM-1969-101-9zbMath0181.51801MaRDI QIDQ5573120
Publication date: 1969
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Related Items
5-chromatic strongly regular graphs, Graphs such that every two edges are contained in a shortest cycle, Linear programming bounds for regular graphs, On the rank 5 polytopes of the Higman-Sims simple group, Ovoids and spreads of finite classical polar spaces, Which graphs are determined by their spectrum?, Computation of Belyi maps with prescribed ramification and applications in Galois theory, The structure of spherical graphs., Unnamed Item, On rank 3 permutation groups, An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter, On existence and regularity of graphs with certain properties, A characterization of complete matroid base graphs, There are exactly five biplanes with k = 11, Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3, Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue, On large (Δ, D, D, 1)-graphs, More about sparse halves in triangle-free graphs, Unnamed Item, Biplanes, Matroid basis graphs. I, The uniqueness of the strongly regular graph on 77 points, Unnamed Item, Cages—a survey
