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


Bipartite partial duals and circuits in medial graphs
Authors:Stephen Huggett  Iain Moffatt
Institution:12850. School of Computing and Mathematics, University of Plymouth, PL4 8AA, Devon, UK
22850. Department of Mathematics Royal Holloway, University of London, Egham, Surrey, TW20 0EX, UK
Abstract:It is well known that a plane graph is Eulerian if and only if its geometric dual is bipartite. We extend this result to partial duals of plane graphs. We then characterize all bipartite partial duals of a plane graph in terms of oriented circuits in its medial graph.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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