CORC  > 上海大学
A Characterization of Box-bounded Degree Sequences of Graphs
Cai, Mao-cheng[1]; Kang, Liying[2]
刊名GRAPHS AND COMBINATORICS
2018
卷号34页码:599-606
关键词Graph Degree sequence Niessen's problem Forcible version
ISSN号0911-0119
URL标识查看原文
内容类型期刊论文
URI标识http://www.corc.org.cn/handle/1471x/2173652
专题上海大学
作者单位1.[1]Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China.
2.[2]Shanghai Univ, Dept Math, Shanghai 200444, Peoples R China.
推荐引用方式
GB/T 7714
Cai, Mao-cheng[1],Kang, Liying[2]. A Characterization of Box-bounded Degree Sequences of Graphs[J]. GRAPHS AND COMBINATORICS,2018,34:599-606.
APA Cai, Mao-cheng[1],&Kang, Liying[2].(2018).A Characterization of Box-bounded Degree Sequences of Graphs.GRAPHS AND COMBINATORICS,34,599-606.
MLA Cai, Mao-cheng[1],et al."A Characterization of Box-bounded Degree Sequences of Graphs".GRAPHS AND COMBINATORICS 34(2018):599-606.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace