Cograph

Known as: P 4-free graph, P4 free graph, P4-free graph

In graph theory, a cograph, or complement-reducible graph, or P4-free graph, is a graph that can be generated from the single-vertex graph K1 by…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

We present a dynamic programming algorithm for optimally solving the Cograph Editing problem on an $n$-vertex graph that runs in…

2015

Let G\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb…

2012

We obtain the reduced form of the “combinatorial logarithm” Ω by looking at bijections related to connected point-determining…

2011

Ag raph is (m, k)-colourable if its vertices can be coloured with m colours such that the maximum degree of the subgraph induced…

2010

An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and…

2007

A cograph completion of an arbitrary graph G is a cograph supergraph of G on the same vertex set. Such a completion is called…

2002

A gain graph (Γ, g, G) is a graph Γ = (V,E) together with a group G, the gain group, and a homomorphism g, the gain function…

2001

We present a simple linear time algorithm finding a Kuratowski subdivision in a DFS cotree critical graphs, based on recent…

1994

In the past, different authors developed distinct approaches to the problem of transitive orientation. This also resulted in…

1959

In mesh-basis analysis of networks with mutual and active elements, it is necessary to list all possible trees or cotrees and…