On Erd˝os-Gallai and Havel-Hakimi algorithms
On Erd˝os-Gallai and Havel-Hakimi algorithms
On Erd˝os-Gallai and Havel-Hakimi algorithms
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
<strong>On</strong> Erdős-<strong>Gallai</strong> <strong>and</strong> <strong>Havel</strong>-<strong>Hakimi</strong> <strong>algorithms</strong> 39<br />
[80] R. P. Stanley, A zonotope associated with graphical degree sequence,<br />
in: Applied geometry <strong>and</strong> discrete mathematics, Festschr. 65th Birthday<br />
Victor Klee. DIMACS Series in Discrete Mathematics <strong>and</strong> Theoretical<br />
Computer Science. 4 (1991) 555-570. ⇒24<br />
[81] R. P. Stanley, Enumerative Combinatorics, Cambridge University Press,<br />
Cambridge, 1997. ⇒24<br />
[82] J. Temesi, Pairwise comparison matrices <strong>and</strong> the error-free property of the<br />
decision maker, CEJOR Cent. Eur. J. Oper. Res. 19, (2) (2011) 239–249.<br />
⇒2<br />
[83] A. Tripathi, H. Tyagi, A simple criterion on degree sequences of graphs,<br />
Discrete Appl. Math. 156, (18) (2008) 3513–3517. ⇒2<br />
[84] A. Tripathi, S. Vijay, A note on a theorem of Erd os & <strong>Gallai</strong>, Discrete<br />
Math. 265, (1–3) (2003) 417–420. ⇒15, 16<br />
[85] A. Tripathi, S. Venugopalanb, D. B. West, A short constructive proof of<br />
the Erdős-<strong>Gallai</strong> characterization of graphic lists, Discrete Math. 310, (4)<br />
(2010) 833–834. ⇒1, 2, 4, 5<br />
[86] E. W. Weisstein, Degree Sequence, From MathWorld—Wolfram Web Resource,<br />
2011. ⇒2<br />
[87] E. W. Weisstein, Graphic Sequence, From MathWorld—Wolfram Web<br />
Resource, 2011. ⇒2<br />
[88] K. J. Winston, D. J. Kleitman, <strong>On</strong> the asymptotic number of tournament<br />
score sequences, J. Combin. Theory Ser. A. 35 (1983) 208–230. ⇒24