Excluding the fork and antifork
暂无分享,去创建一个
Abstract The fork is the tree obtained from the claw K 1 , 3 by subdividing one of its edges once, and the antifork is its complement graph. We give a complete description of all graphs that do not contain the fork or antifork as induced subgraphs.
[1] Ingo Schiermeyer,et al. Vertex Colouring and Forbidden Subgraphs – A Survey , 2004, Graphs Comb..
[2] Martin Milanič,et al. A polynomial algorithm to find an independent set of maximum weight in a fork-free graph , 2006, SODA '06.