Graphs with Maximal Even Girth

DOI10.4153/CJM-1969-101-9MaRDI QIDQ5573120zbMATH OpenFDO

Authors Allan Gewirtz

Publication date 1969

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1969-101-9

zbMATH Keywords

topology

Cited in

(27)

• Graphs such that every two edges are contained in a shortest cycle
• Ovoids and spreads of finite classical polar spaces
• On rank 3 permutation groups
• On existence and regularity of graphs with certain properties
• A characterization of complete matroid base graphs
• Which graphs are determined by their spectrum?
• The structure of spherical graphs.
• Computation of Belyi maps with prescribed ramification and applications in Galois theory
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Biplanes
• Matroid basis graphs. I
• On the rank 5 polytopes of the Higman-Sims simple group
• Maximizing the order of a regular graph of given valency and second eigenvalue
• On large ( , D, D, 1)-graphs
• An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter
• More about sparse halves in triangle-free graphs
• The uniqueness of the strongly regular graph on 77 points
• Cages—a survey
• scientific article; zbMATH DE number 3485844 (Why is no real title available?)
• scientific article; zbMATH DE number 1341365 (Why is no real title available?)
• scientific article; zbMATH DE number 7068502 (Why is no real title available?)
• There are exactly five biplanes with k = 11
• Genuinely nonabelian partial difference sets
• Hemisystems and strongly regular graphs
• Classification of finite highly regular vertex-colored graphs
• 5-chromatic strongly regular graphs
• Linear programming bounds for regular graphs

This page was built for publication: Graphs with Maximal Even Girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5573120)