On Determining the Minimum Number of Multiple Edges for an Incidence Sequence
Alvin B. Owens · SIAM Journal on Applied Mathematics · 1970
Previous article Next article On Determining the Minimum Number of Multiple Edges for an Incidence SequenceAlvin B. OwensAlvin B. Owenshttps://doi.org/10.1137/0118019PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] A. B. Owens and , H. M. Trent, On determining minimal singularities for the realizations of an incidence sequence, SIAM J. Appl. Math., 15 (1967), 406–418 10.1137/0115036 MR0211920 0148.17902 LinkISIGoogle Scholar[2] S. L. Hakimi, On realizability of a set of integers as degrees of the vertices of a linear graph. II. Uniqueness, J. Soc. Indust. Appl. Math., 11 (1963), 135–147 10.1137/0111010 MR0153001 0117.41102 LinkISIGoogle Scholar[3] Oystein Ore, Theory of graphs, American Mathematical Society Colloquium Publications, Vol. XXXVIII, American Mathematical Society, Providence, R.I., 1962x+270 MR0150753 0105.35401 CrossrefGoogle Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Relaxed and Approximate Graph Realizations30 June 2021 Cross Ref A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences9 October 2006 Cross Ref Some problems in discrete optimizationMathematical Programming, Vol. 1, No. 1 Cross Ref Bibliography Cross Ref Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without LoopsDaniel J. Kleitman31 July 2006 | SIAM Journal on Applied Mathematics, Vol. 18, No. 1AbstractPDF (335 KB) Volume 18, Issue 1| 1970SIAM Journal on Applied Mathematics History Submitted:19 December 1968Published online:31 July 2006 InformationCopyright © 1970 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0118019Article page range:pp. 238-240ISSN (print):0036-1399ISSN (online):1095-712XPublisher:Society for Industrial and Applied Mathematics