On cocircuit covers of bicircular matroids
详细信息查看全文 | 推荐本文 |
摘要
Given a graph G, one can define a matroid View the MathML source on the edges E of G with circuits View the MathML source where e883aaf59efd6fd55890e12dbfb4dff">View the MathML source is either the cycles of e88b91d7bbb649c936f" title="Click to view the MathML source" alt="Click to view the MathML source">G or the bicycles of 11ef493a98c5f992193632388" title="Click to view the MathML source" alt="Click to view the MathML source">G. The former is called the cycle matroid of G and the latter the bicircular matroid of G. For each bicircular matroid B(G), we find a cocircuit cover of size at most the circumference of B(G) that contains every edge at least twice. This extends the result of Neumann-Lara, Rivera-Campo and Urrutia for graphic matroids.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700