Maximum bipartite subgraphs of cubic triangle-free planar graphs |
| |
| Authors: | Qing Cui Jian Wang |
| |
| Institution: | Center for Combinatorics, LPMC-TJKLC, Nankai University, Tianjin 300071, PR China |
| |
| Abstract: | Thomassen recently proved, using the Tutte cycle technique, that if G is a 3-connected cubic triangle-free planar graph then G contains a bipartite subgraph with at least  edges, improving the previously known lower bound  . We extend Thomassen’s technique and further improve this lower bound to  . |
| |
| Keywords: | Bipartite subgraph Tutte subgraph Cubic planar graph Triangle-free |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
