|کد مقاله||کد نشریه||سال انتشار||مقاله انگلیسی||ترجمه فارسی||نسخه تمام متن|
|5777342||1413658||2018||14 صفحه PDF||سفارش دهید||دانلود کنید|
We show that any 3-connected cubic plane graph on n vertices, with all faces of size at most 6, can be made bipartite by deleting no more than (p+3t)nâ5 edges, where p and t are the numbers of pentagonal and triangular faces, respectively. In particular, any such graph can be made bipartite by deleting at most 12nâ5 edges. This bound is tight, and we characterise the extremal graphs. We deduce tight lower bounds on the size of a maximum cut and a maximum independent set for this class of graphs. This extends and sharpens the results of Faria et al. (2012).
Journal: European Journal of Combinatorics - Volume 67, January 2018, Pages 208-221