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.

2015

Abstract. The kinematic modeling of multi-loop mechanisms requires a systematic representation of the kinematic topology, i.e…

2011

The recent discovery of a physical device behaving as a memristor has driven a lot of attention to memristive systems, which are…

2009

It is known that the conventional algorithm (CA) of hybrid flnite element-boundary integral-multilevel fast multipole algorithm…

2008

In recent years the development of high-speed circuits leads to a demand in accurate and reliable full-wave electromagnetic…

2007

We develop a differential form based formalism to address the problem of low-frequency breakdown of the electric field integral…

2006

We show that it is equivalent, for certain sets of finite graphs, to be definable in CMS (counting monadic second-order logic, a…

2002

A general approach to directly couple finite element models with arbitrary electric circuits is presented for the application of…

2001

The calculus of structures is a new framework for presenting logical systems. It is a generalisation of a traditional framework…

1997

1959

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