A characterization of chain probe graphs

被引：0
|
作者：
Martin C. Golumbic
Frédéric Maffray
Grégory Morel
机构：
[1] University of Haifa,Caesarea Rothschild Institute and Department of Computer Science
[2] Laboratoire G-SCOP,C.N.R.S.
[3] Laboratoire G-SCOP,undefined
来源：
Annals of Operations Research | 2011年 / 188卷
关键词：
Bipartite Graph; Perfect Graph; Probe Graph; Discrete Apply Mathematic; Chain Graph;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A chain probe graph is a graph that admits an independent set S of vertices and a set F of pairs of elements of S such that G+F is a chain graph (i.e., a 2K2-free bipartite graph). We show that chain probe graphs are exactly the bipartite graphs that do not contain as an induced subgraph a member of a family of six forbidden subgraphs, and deduce an O(n2) recognition algorithm.
引用
收藏
页码：175 / 183
页数：8
相关论文
共 50 条
12345