Cograph¶

A graph generated from single vertices by repeated disjoint union and complementation, equivalently a graph with no induced four-vertex path and a recursive cotree decomposition.

Version: v2 · 2026-09-19 · History
Domain-specific #: 3731
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Graph Theory, Hereditary Graph Classes → Mathematics

Core Idea¶

Cographs are the smallest graph class containing one-vertex graphs and closed under disjoint union and complement, equivalently the P4-free graphs. A cotree records recursive union or join composition; the absence of induced P4 makes this decomposition canonical up to simple equivalences and supports efficient algorithms. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

The load-bearing residual is not the broad topic of graph theory. It is complement-reducible graph structure and cotree algorithms. That residual remains recognizable when examples, notation, scale, or implementation change, but it disappears if the carrier is mistyped, the condition that the graph contains no induced path on four vertices, equivalently it admits a valid recursive union-complement construction fails, a neighboring object is substituted, or notation and topical resemblance replace the constitutive test.

How would you explain it like I'm…

Two-Move Dot Pictures

Start with single dots. You can build bigger dot pictures with just two moves: put two pictures side by side with no lines between them, or put them side by side and draw a line from every dot in one to every dot in the other. Any picture you can build this way is a cograph.

Graphs Built by Union and Join

In graph theory, a graph is a set of dots with lines connecting some pairs. A cograph is a graph you can build from single dots using only two steps, over and over: put two graphs next to each other without connecting them, or connect every dot of one graph to every dot of the other. Another way to tell: a cograph never contains four dots connected just like a simple path, A-B-C-D, with no other lines among them. Because every cograph comes with its building recipe, recorded in a tree, computers can solve many hard problems on them quickly.

P4-Free Complement-Reducible Graphs

A cograph (short for complement-reducible graph) is a graph that can be built from single vertices using two operations: disjoint union, and complement (flipping every edge to a non-edge and vice versa). Equivalently, cographs are exactly the graphs with no induced path on four vertices, called P4-free graphs: you cannot pick four vertices whose only edges among them form a path a-b-c-d. Using union and complement together gives a 'join' operation, connecting every vertex of one graph to every vertex of another. Every cograph can be recorded as a cotree, a tree whose leaves are the vertices and whose internal nodes say 'union' or 'join'. Because this decomposition is essentially unique, many problems that are hard on general graphs can be solved efficiently on cographs by working up the cotree.

Cographs are the smallest class of graphs containing the one-vertex graph and closed under disjoint union and complementation; equivalently, they are the P4-free graphs, those with no induced path on four vertices. Combining union and complement yields the join operation, so every cograph decomposes recursively into unions and joins of smaller cographs. This decomposition is recorded in a cotree, whose leaves are vertices and whose internal nodes are labeled union or join; two vertices are adjacent exactly when their lowest common ancestor is a join node. The absence of an induced P4 makes the cotree canonical up to simple equivalences, such as merging consecutive nodes with the same label. That canonical structure supports efficient algorithms, including for problems that are hard on general graphs. Membership is decided by the constitutive test, either P4-freeness or a valid union-complement construction, not by resemblance to some example graph.

Scope of Application¶

Cograph belongs to graph theory and is useful where the analyst can specify a finite simple graph, induced subgraphs, disjoint union and join operations, complementation, a P4 obstruction, and a cotree, then evaluate the graph contains no induced path on four vertices, equivalently it admits a valid recursive union-complement construction. The scope is broad within that domain but bounded by the need for the graph contains no induced path on four vertices, equivalently it admits a valid recursive union-complement construction. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the graph contains no induced path on four vertices, equivalently it admits a valid recursive union-complement construction the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test. A bare label is insufficient because the name Cograph can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Cograph. Cograph compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: a finite simple graph, induced subgraphs, disjoint union and join operations, complementation, a P4 obstruction, and a cotree. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express the graph contains no induced path on four vertices, equivalently it admits a valid recursive union-complement construction independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of graph theory because they reuse a finite simple graph, induced subgraphs, disjoint union and join operations, complementation, a P4 obstruction, and a cotree, A cotree records recursive union or join composition; the absence of induced P4 makes this decomposition canonical up to simple equivalences and supports efficient algorithms., and type the carrier, state every parameter and convention in the definition, test that the graph contains no induced path on four vertices, equivalently it admits a valid recursive union-complement construction, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Cograph Domain-specific

Parents (1) — outgoing typed relations

Cograph is a kind of Composition Prime

The class is generated recursively by union and complement composition.

Hierarchy path (1) — routes to 1 parentless root

Cograph → is a kind of Composition → presupposes Gestalt Principles → is a decomposition of Holism

Neighborhood in Abstraction Space¶

Cograph sits in a crowded region of the domain-specific corpus (11^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Graph Classes & Invariants (40 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25