首页 | 本学科首页   官方微博 | 高级检索  
     检索      


The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four
Authors:Anna Galluccio  Luis A Goddyn
Institution:(1) Istituto di Analisi dei Sistemi ed Informatica – CNR; Viale Manzoni 30, 00185 Roma, Italy; E-mail: galluccio@iasi.rm.cnr.it, IT;(2) Department of Mathematics and Statistics, Simon Fraser University; 8888 University Drive Burnaby, BC V5A 1S6, Canada; E-mail: goddyn@math.sfu.ca, CA
Abstract:We show that every 6-edge connected graph admits a circulation whose range lies in the interval 1,3). Received March 29, 2000 RID="*" ID="*" Supported by NATO-CNR Fellowship; this work was done while the author was visiting the Dept. of Mathematics and Statistics at Simon Fraser University, Canada. RID="†" ID="†" Supported by a National Sciences and Engineering Research Council Research Grant
Keywords:AMS Subject Classification (2000) Classes:   05C70  90B10  90C35
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号