863
个编辑
更改
跳到导航
跳到搜索
第80行：
第80行： − + − + − +
→参考
==参考==
==参考==
* {{Citation|last=Diestel|first=Reinhard|title=Graph Theory|url=http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/|publisher=Springer-Verlag|place=Berlin, New York|edition=3rd|isbn=978-3-540-26183-4|year=2005|accessdate=2019-04-23|archive-date=2011-07-28|archive-url=https://web.archive.org/web/20110728103939/http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/|dead-url=no}}.
* {{Citation|last=Diestel|first=Reinhard|title=Graph Theory|url=http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/|publisher=Springer-Verlag|place=Berlin, New York|edition=3rd|isbn=978-3-540-26183-4|year=2005|accessdate=2019-04-23|archive-date=2011-07-28|archive-url=https://web.archive.org/web/20110728103939}}.
* {{Citation|first=P.|last=Erdős|author-link=Paul Erdős|first2=T.|last2=Gallai|author2-link=Tibor Gallai|title=Gráfok előírt fokszámú pontokkal|language=hu|journal=Matematikai Lapok|volume=11|year=1960|pages=264–274|url=http://www.renyi.hu/~p_erdos/1961-05.pdf}}.
* {{Citation|author-link=Paul Erdős|author2-link=Tibor Gallai|title=Gráfok előírt fokszámú pontokkal|language=hu|journal=Matematikai Lapok|volume=11|year=1960|pages=264–274|url=http://www.renyi.hu/~p_erdos/1961-05.pdf}}.
* {{Citation|last=Havel|first=Václav|author-link=V. J. Havel|year=1955|title=A remark on the existence of finite graphs|language=cs|journal=Časopis pro pěstování matematiky|volume=80|pages=477–480|url=http://eudml.org/doc/19050|accessdate=2019-04-23|archive-date=2017-07-29|archive-url=https://web.archive.org/web/20170729174826/https://eudml.org/doc/19050|dead-url=no}}
* {{Citation|last=Havel|first=Václav|author-link=V. J. Havel|year=1955|title=A remark on the existence of finite graphs|language=cs|journal=Časopis pro pěstování matematiky|volume=80|pages=477–480|url=http://eudml.org/doc/19050|accessdate=2019-04-23}}
* {{Citation|author-link=S. L. Hakimi|journal=Journal of the Society for Industrial and Applied Mathematics|pages=496–506|title=On realizability of a set of integers as degrees of the vertices of a linear graph. I|volume=10|year=1962}}.
* {{Citation|author-link=S. L. Hakimi|journal=Journal of the Society for Industrial and Applied Mathematics|pages=496–506|title=On realizability of a set of integers as degrees of the vertices of a linear graph. I|volume=10|year=1962}}.
* {{Citation|last=Sierksma|first=Gerard|last2=Hoogeveen|first2=Han|doi=10.1002/jgt.3190150209|number=2|journal=Journal of Graph Theory|pages=223–231|title=Seven criteria for integer sequences being graphic|volume=15|year=1991}}.
* {{Citation|last=Sierksma|first=Gerard|last2=Hoogeveen|first2=Han|doi=10.1002/jgt.3190150209|number=2|journal=Journal of Graph Theory|pages=223–231|title=Seven criteria for integer sequences being graphic|volume=15|year=1991}}.