Parsimonious multigraphs

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 2, 2004, Pages 241-245

  Will, Todd G ^a   Hulett, Heather ^a  

^a UNIVERSITY OF WISCONSIN LA CROSSE   (United States)

Author keywords

Degree sequence; Multigraph; Parsimonious

Indexed keywords

DEGREE SEQUENCES; MULTIGRAPHS; MULTIPLICITY; PARSIMONIOUS;

ALGORITHMS; INTEGRAL EQUATIONS; NUMBER THEORY; SET THEORY; THEOREM PROVING;

GRAPH THEORY;

EID: 18744396083     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103432477     Document Type: Article

References (7)

1. R. A. BRUALDI AND T. S. MICHAEL, The class of 2-multigraphs with a prescribed degree sequence, Linear and Multilinear Algebra, 24 (1989), pp. 81-102.
2. R. B. EGGLETON AND D. A. HOLTON, Simple and multigraphic realizations of degree sequences, in Combinatorial Mathematics, VIII (Geelong, 1980), Lecture Notes in Math. 884, Springer-Verlag, Berlin, New York, 1981, pp. 155-172.
3. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability. A Guide to the Theory of NP-Completeness, A Series of Books in the Mathematical Sciences, W. H. Freeman and Co., San Francisco, CA, 1979.
4. A. J. GOLDMAN AND R. H. BYRD, Minimum-loop realization of degree sequences, J. Res. Nat. Bur. Standards, 87 (1982), pp. 75-78.
5. D. J. KLEITMAN, Minimal number of multiple edges in realization of an incidence sequence without loops, SIAM J. Appl. Math., 18 (1970), pp. 25-28.
6. Z. MAJCHER, Alternating cycles and realizations of a degree sequence, Comment. Math. Univ. Carolin., 28 (1987), pp. 467-480.
7. T. G. WILL AND D. B. WEST, Parsimonious 2-multigraphs, in Graph Theory, Combinatorics, and Algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992), Wiley-Interscience, Wiley, New York, 1995, pp. 1249-1258.