Dvo??k، نويسنده , , Zden?k and Lidick?، نويسنده , , Bernard and ?krekovski، نويسنده , , Riste، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2012
Pages :
8
From page :
1286
To page :
1293
Abstract :
A fullerene graph is a cubic bridgeless planar graph with twelve 5-faces such that all other faces are 6-faces. We show that any fullerene graph on n vertices can be bipartized by removing O ( n ) edges. This bound is asymptotically optimal.
