Construction of graphs with given circular flow number.

淡江大學機構典藏 > 理學院 > 數學學系暨研究所 > 期刊論文 > Item 987654321/58703

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/58703

题名:	Construction of graphs with given circular flow number.
作者:	潘志實
贡献者:	淡江大學數學學系
关键词:	graph;flow;circular flow number;rooted-flow;series join;parallel join;two-terminal graph
日期:	2003-07-07
上传时间:	2011-10-01 21:04:36 (UTC+8)
摘要:	Suppose r ≥ 2 is a real number. A proper r-flow of a directed multi-graph equation image is a mapping equation image such that (i) for every edge equation image, equation image; (ii) for every vertex equation image, equation image. The circular flow number of a graph G is the least r for which an orientation of G admits a proper r-flow. The well-known 5-flow conjecture is equivalent to the statement that every bridgeless graph has circular flow number at most 5. In this paper, we prove that for any rational number r between 2 and 5, there exists a graph G with circular flow number r. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 304–318, 2003
關聯:	J. Graph Theory 43,　p.304-318
DOI:	10.1002/jgt.10124
显示于类别:	[數學學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
Construction of graphs with given circular flow number.pdf		158Kb	Adobe PDF	1	检视/开启
index.html		0Kb	HTML	65	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章