A 2-Bisection with Small Number of Monochromatic Edges of a Claw-Free Cubic Graph
A 2-Bisection with Small Number of Monochromatic Edges of a Claw-Free Cubic Graph
复制标题
无爪三次图的具有少量单色边的二等分
DOI:
10.1007/s00373-023-02611-5
复制
发表时间:
2023
影响因子:
0.7
通讯作者:
Kenta Ozeki
中科院分区:
文献类型:
--
作者:
Seungjae Eom;Kenta Ozeki
A bisection of a graphGis a partition of its vertex set into two parts of the same cardinality. Ak-bisection ofGis a bisection ofGsuch that every component of each part has at mostkvertices. Cui and Liu proved that every claw-free cubic graph contains a 2-bisection. In this paper, we improve this result showing that every claw-free cubic graph contains a 2-bisection with bounded number of monochromatic edges, where amonochromatic edgeof a 2-bisection is an edge connecting two vertices of the same part of the 2-bisection. We also prove that our bound is best possible for all claw-free cubic simple graphs.
影响因子:
0.9
作者:
M. Abreu;Jan Goedgebeur;D. Labbate;G. Mazzuoccolo
通讯作者:
G. Mazzuoccolo
DOI:
10.1016/j.dam.2018.03.016
发表时间:
2017
期刊:
Discret. Appl. Math.
影响因子:
--
作者:
M. Abreu;Jan Goedgebeur;D. Labbate;G. Mazzuoccolo
通讯作者:
G. Mazzuoccolo