QQ客服 官方微博 反馈留言

	Relation between the skew-rank of an oriented graph and the independence number of its underlying graph
	Huang, Jing; Li, Shuchao*; Wang, Hua
刊名	Journal of Combinatorial Optimization
	2018
卷号	36期号:1页码:65-80
关键词	Skew-rank Oriented graph Evenly-oriented Independence number
ISSN号	1382-6905
DOI	10.1007/s10878-018-0282-x
URL标识	查看原文
WOS记录号	WOS:000434382000007;EI:20181404974200
内容类型	期刊论文
URI标识	http://www.corc.org.cn/handle/1471x/5154731
专题	华中师范大学
作者单位	1.[Huang, Jing 2.Li, Shuchao] Cent China Normal Univ, Fac Math & Stat, Wuhan 430079, Hubei, Peoples R China.
推荐引用方式 GB/T 7714	Huang, Jing,Li, Shuchao*,Wang, Hua. Relation between the skew-rank of an oriented graph and the independence number of its underlying graph[J]. Journal of Combinatorial Optimization,2018,36(1):65-80.
APA	Huang, Jing,Li, Shuchao*,&Wang, Hua.(2018).Relation between the skew-rank of an oriented graph and the independence number of its underlying graph.Journal of Combinatorial Optimization,36(1),65-80.
MLA	Huang, Jing,et al."Relation between the skew-rank of an oriented graph and the independence number of its underlying graph".Journal of Combinatorial Optimization 36.1(2018):65-80.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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