Previous |  Up |  Next

Article

References:
[1] D. BILLINGTON: Connected subgraphs of the graph of multigraphic realizations of a degree sequence. Combinatorial Math. VIII, Proc. 8th Australian Conf. on Combinatorial Math., Geelong, 1980 (Springer-Verlag, L.N.M. 884, 1981), 125-135. MR 0641242
[2] R. B. EGGLETON: Graphic sequences and graphic polynomials: a report. in: Infinite and Finite Sets, Vol. 1, Colloq. Math. Soc. J. Bolyai 10 (North-Holland, Amsterdam, 1975), 385-392. MR 0384612 | Zbl 0313.05123
[3] R. B. EGGLETON D. A. HOLTON: The graph of type $(0,\infty, \infty)$ realizations of a graphic sequence. Combinatorial Math. VI, Proc. 6th Australian Conf. on Combinatorial Math., Armidale, 1978 (Springer-Verlag, L.N.M. 748, 1979), 41-54. MR 0558032
[4] R. B. EGGLETON D. A. HOLTON: Simple and multigraphic realizations of degree sequences. Combinatorial Math. VIII, Proc. 8th Australian Conf. on Combinatorial Math., Geelong, 1980 (Springer-Verlag, L.N.M. 884, 1981), 155-172. MR 0641245
[5] Z. MAJCHER: Graphic matrices (in print).
[6] R. TAYLOR: Constrained switchings in graphs. Combinatorial Math. VIII, Proc. 8th Australian Conf. on Combinatorial Math., Geelong, 1980 (Springer-Verlag, L.N.M. 884, 1981), 314-336. MR 0641256
Partner of
EuDML logo