第81行: |
第81行: |
| | | |
| ==参考== | | ==参考== |
− | * {{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 | last1=Diestel | first1=Reinhard | title=Graph Theory | url=http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/ | publisher=Springer-Verlag | location=Berlin, New York | edition=3rd | isbn=978-3-540-26183-4 | year=2005 }}. |
− | * {{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|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|first1=P.|last1=Erdős|author1-link=Paul Erdős|first2=T.|last2=Gallai|author2-link=Tibor Gallai|title=Gráfok előírt fokszámú pontokkal|language=Hungarian|journal=Matematikai Lapok|volume=11|year=1960|pages=264–274|url=http://www.renyi.hu/~p_erdos/1961-05.pdf}}. |
− | * {{Citation|last=Hakimi|first=S. L.|author-link=S. L. Hakimi|journal=Journal of the [[Society for Industrial and Applied Mathematics]]|mr=0148049|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]]|mr=1106533|pages=223–231|title=Seven criteria for integer sequences being graphic|volume=15|year=1991}}. | + | *{{citation |
| + | |
| + | | last= Havel |
| + | |
| + | | last= Havel |
| + | |
| + | | last = Havel |
| + | |
| + | | first= Václav |
| + | |
| + | | first= Václav |
| + | |
| + | | first= Václav |
| + | |
| + | | authorlink =V. J. Havel |
| + | |
| + | | authorlink =V. J. Havel |
| + | |
| + | | authorlink = v.J · 哈维尔 |
| + | |
| + | | year = 1955 |
| + | |
| + | | year = 1955 |
| + | |
| + | 1955年 |
| + | |
| + | | title = A remark on the existence of finite graphs |
| + | |
| + | | title = A remark on the existence of finite graphs |
| + | |
| + | | title = 关于有限图存在性的一个注记 |
| + | |
| + | | language = Czech |
| + | |
| + | | language = Czech |
| + | |
| + | | language = Czech |
| + | |
| + | | journal = Časopis pro pěstování matematiky |
| + | |
| + | | journal = Časopis pro pěstování matematiky |
| + | |
| + | | journal = Časopis pro pěstování matematiky |
| + | |
| + | | volume = 80 |
| + | |
| + | | volume = 80 |
| + | |
| + | 80 |
| + | |
| + | | pages = 477–480 |
| + | |
| + | | pages = 477–480 |
| + | |
| + | | 页数 = 477-480 |
| + | |
| + | | url = http://eudml.org/doc/19050 |
| + | |
| + | | url = http://eudml.org/doc/19050 |
| + | |
| + | Http://eudml.org/doc/19050 |
| + | |
| + | }} |
| + | }} |
| + | }} |
| + | |
| + | |
| + | *{{citation |
| + | |
| + | | last = Hakimi | first = S. L. | authorlink = S. L. Hakimi |
| + | |
| + | | last = Hakimi | first = S. L. | authorlink = S. L. Hakimi |
| + | |
| + | 最后 = Hakimi | first = S.l. | authorlink = S.l. Hakimi |
| + | |
| + | | journal = Journal of the [[Society for Industrial and Applied Mathematics]] |
| + | |
| + | | journal = Journal of the Society for Industrial and Applied Mathematics |
| + | |
| + | 工业与应用数学学会杂志 |
| + | |
| + | | mr = 0148049 |
| + | |
| + | | mr = 0148049 |
| + | |
| + | 0148049先生 |
| + | |
| + | | pages = 496–506 |
| + | |
| + | | pages = 496–506 |
| + | |
| + | | 页数 = 496-506 |
| + | |
| + | | title = On realizability of a set of integers as degrees of the vertices of a linear graph. I |
| + | |
| + | | title = On realizability of a set of integers as degrees of the vertices of a linear graph. I |
| + | |
| + | | title = 一组整数作为线性图顶点度的可实现性。一 |
| + | |
| + | | volume = 10 |
| + | |
| + | | volume = 10 |
| + | |
| + | 10 |
| + | |
| + | | year = 1962}}. |
| + | |
| + | | year = 1962}}. |
| + | |
| + | 1962}}. |
| + | |
| + | *{{citation |
| + | |
| + | | last1 = Sierksma | first1 = Gerard |
| + | |
| + | | last1 = Sierksma | first1 = Gerard |
| + | |
| + | 1 = 杰拉德 |
| + | |
| + | | last2 = Hoogeveen | first2 = Han |
| + | |
| + | | last2 = Hoogeveen | first2 = Han |
| + | |
| + | | last2 = Hoogeveen | first2 = Han |
| + | |
| + | | doi = 10.1002/jgt.3190150209 |
| + | |
| + | | doi = 10.1002/jgt.3190150209 |
| + | |
| + | 10.1002/jgt. 3190150209 |
| + | |
| + | | issue = 2 |
| + | |
| + | | issue = 2 |
| + | |
| + | 2 |
| + | |
| + | | journal = [[Journal of Graph Theory]] |
| + | |
| + | | journal = Journal of Graph Theory |
| + | |
| + | | Journal = Journal of Graph Theory |
| + | |
| + | | mr = 1106533 |
| + | |
| + | | mr = 1106533 |
| + | |
| + | 1106533先生 |
| + | |
| + | | pages = 223–231 |
| + | |
| + | | pages = 223–231 |
| + | |
| + | | pages = 223-231 |
| + | |
| + | | title = Seven criteria for integer sequences being graphic |
| + | |
| + | | title = Seven criteria for integer sequences being graphic |
| + | |
| + | | title = 整数序列为图形的七个条件 |
| + | |
| + | | volume = 15 |
| + | |
| + | | volume = 15 |
| + | |
| + | 15 |
| + | |
| + | | year = 1991}}. |
| + | |
| + | | year = 1991}}. |
| + | |
| + | 1991}}. |
| | | |
| 本中文词条由[[用户:Ryan|Ryan]] 参与编译, [[用户:CecileLi|CecileLi]] 审校,[[用户:不是海绵宝宝|不是海绵宝宝]]编辑,欢迎在讨论页面留言。 | | 本中文词条由[[用户:Ryan|Ryan]] 参与编译, [[用户:CecileLi|CecileLi]] 审校,[[用户:不是海绵宝宝|不是海绵宝宝]]编辑,欢迎在讨论页面留言。 |