Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops
Daniel J. Kleitman · SIAM Journal on Applied Mathematics · 1970
Previous article Next article Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without LoopsDaniel J. KleitmanDaniel J. Kleitmanhttps://doi.org/10.1137/0118005PDFBibTexSections 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] Alvin B. Owens, On determining the minimum number of multiple edges for an incidence sequence, SIAM J. Appl. Math., 18 (1970), 238–240 10.1137/0118019 MR0265227 0204.24601 LinkISIGoogle Scholar[3] S. L. Hakimi, On realizability of a set of integers as degrees of the vertices of a linear graph. I, J. Soc. Indust. Appl. Math., 10 (1962), 496–506 10.1137/0110037 MR0148049 0109.16501 LinkISIGoogle Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails Relaxed and Approximate Graph RealizationsCombinatorial Algorithms | 30 June 2021 Cross Ref Multigraph realizations of degree sequences: Maximization is easy, minimization is hardOperations Research Letters, Vol. 36, No. 5 | 1 Sep 2008 Cross Ref Parsimonious MultigraphsTodd G. Will and Heather HulettSIAM Journal on Discrete Mathematics, Vol. 18, No. 2 | 1 August 2006AbstractPDF (96 KB)A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequencesCombinatorics and Graph Theory | 9 October 2006 Cross Ref Construction of a Maximally Edge-Connected Graph with Prescribed DegreesStudies in Applied Mathematics, Vol. 55, No. 1 | 28 September 2015 Cross Ref Algorithms for constructing graphs and digraphs with given valences and factorsDiscrete Mathematics, Vol. 6, No. 1 | 1 Sep 1973 Cross Ref On the existence of N-connected graphs with prescribed degrees (n ≧ 2)Networks, Vol. 3, No. 3 | 1 Jan 1973 Cross Ref Some problems in discrete optimizationMathematical Programming, Vol. 1, No. 1 | 1 Dec 1971 Cross Ref BibliographyApplied Graph Theory | 1 Jan 1971 Cross Ref Volume 18, Issue 1| 1970SIAM Journal on Applied Mathematics History Submitted:05 March 1969Published online:31 July 2006 InformationCopyright © 1970 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0118005Article page range:pp. 25-28ISSN (print):0036-1399ISSN (online):1095-712XPublisher:Society for Industrial and Applied Mathematics