A characterization problem in graph theory

DOI10.1016/S0021-9800(69)80104-3zbMath0175.50401OpenAlexW2052046856MaRDI QIDQ5565639

Martin Aigner

Publication date: 1969

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80104-3

zbMATH Keywords

topology

Related Items

Iterated \(k\)-line graphs, Characterization of the odd graphs \(O_ k \)by parameters, On the uniqueness of the tetrahedral association schemes, The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\), Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k), On the uniqueness of the graphs G(n,k) of the Johnson schemes