A good characterization of cograph contractions
نویسنده
چکیده
A graph is called a cograph contraction if it is obtained from a cograph (a graph with no induced path on four vertices) by contracting some pairwise disjoint independent sets and then making the ‘‘contracted’’ vertices pairwise adjacent. Cograph contractions are perfect and generalize cographs and split graphs. This article gives a good characterization of cograph contractions, solving a problem posed by M. Hujter and Zs. Tuza. c © 1999 John Wiley & Sons, Inc. J Graph Theory 30:
منابع مشابه
Reports in Informatics Characterizing and Computing Minimal Cograph Completions Characterizing and Computing Minimal Cograph Completions *
A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we present two results on minimal cograph completions. The first is a a characterization that allows us to check in linear time whether a given cograph completion is minimal. The second result is ...
متن کاملCharacterizing and Computing Minimal Cograph Completions
A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called minimal if the set of edges added to G is inclusion minimal. In this paper we present two results on minimal cograph completions. The first is a a characterization that allows us to check in linear time whether a given cograph completion is minimal. The second result is ...
متن کاملCograph Recognition Algorithm Revisited and Online Induced P4 Search
In 1985, Corneil, Perl and Stewart CPS85] gave a linear incremental algorithm to recognize cographs (graphs with no induced P4). When this algorithm stops, either the initial graph is a cograph and the cotree of the whole graph has been built, or the initial graph is not a cograph and this algorithm ends up with a vertex v and a cotree cot such that v cannot be inserted in cot; so the input gra...
متن کاملGeneralized Colourings (Matrix Partitions) of Cographs
Ordinary colourings of cographs are well understood; we focus on more general colourings, known as matrix partitions. We show that all matrix partition problems for cographs admit polynomial time algorithms and forbidden induced subgraph characterizations, even for the list version of the problems. Cographs are the largest natural class of graphs that have been shown to have this property. We b...
متن کاملExact and heuristic algorithms for Cograph Editing
We present a dynamic programming algorithm for optimally solving the Cograph Editing problem on an n-vertex graph that runs in O(3n) time and uses O(2) space. In this problem, we are given a graph G = (V,E) and the task is to find a smallest possible set F ⊆ V × V of vertex pairs such that (V,E4F ) is a cograph (or P4-free graph), where 4 represents the symmetric difference operator. We also de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 30 شماره
صفحات -
تاریخ انتشار 1999