Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
From MaRDI portal
Publication:5183533
DOI10.1137/0128070zbMath0275.05125WikidataQ56227293 ScholiaQ56227293MaRDI QIDQ5183533
N. J. A. Sloane, Colin L. Mallows
Publication date: 1975
Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0128070
05C30: Enumeration in graph theory
Related Items
An Ore-type condition for cyclability, Multiple outliers detection through reweighted least deviances., On deciding switching equivalence of graphs, Remark on the generalized graph extension theorem, Inclusion transformations: \((n,m)\)-graphs and their classification, The isolation game for regular graphs, Robust autoregressive estimates using quadratic programming, Determinants of matrices of the conference type, On the computation and efficiency of a HBP-GM estimator some simulation results, Switching with more than two colours., Functional stability of one-step GM-estimators in approximately linear regression, On B-robust instrumental variable estimation of the linear model with panel data., Cohomological Aspects of Hypergraphs