Live briefing
Everything about Cograph
Graph formed by complementation and disjoint union
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 complementation and disjoint union. That is, the family of cographs is the smallest class of graphs that includes K1 and is closed under complementation and disjoint union. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: CographA 5-minute orientation
- Skim a recent paper: On finite groups whose power graph is a cographInfluential work since 2022
- Pick up a classic book: A cograph approach to examination schedulingThe most-reprinted book on the subject
- Read the landmark paper: A simple linear time algorithm for cograph recognitionCited 70 times
- Go sideways: Complement graphA closely related topic
- Go sideways: Trivially perfect graphA closely related topic
📖 Definitions
Noun A graph formed from another by complementation and disjoin union.
Noun The dual of the graph of a function. It is an ordinate-indexed partition of the disjoint union of the set of abscissas and ordinates of the function.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A simple linear time algorithm for cograph recognition
A Simple Linear Time LexBFS Cograph Recognition Algorithm
Complexity and parameterized algorithms for Cograph Editing
Defining and identifying cograph communities in complex networks
The Rank of a Cograph
On the rank of a cograph
BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES
On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions
🆕 Influential since 2022
On finite groups whose power graph is a cograph
User-generated short-text classification using cograph editing-based network clustering with an application in invoice categorization
Finite groups whose coprime graph is split, threshold, chordal, or a cograph
A linear algorithm for obtaining the Laplacian eigenvalues of a cograph
$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses
📚 Books worth reading
- 📕A cograph approach to examination schedulingStephen Daniel Shew · 1986
- 📕CographsLorna Stewart · 1978
- 📕LexBFS based recognition algorithms for cographs and related familiesAnna Bretscher · 2005
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Complement graph In the mathematical field of graph theory, the complement or inverse of a graph G is a graph H on the same vertices such that two distinct vertices are…
- Trivially perfect graph In graph theory, a trivially perfect graph is a graph with the property that in each of its induced subgraphs the size of the maximum independent set equals…
- Perfect graph In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every…
- Distance-hereditary graph In graph theory, a branch of discrete mathematics, a distance-hereditary graph (also called a completely separable graph) is a graph in which the distances…
- Chordal graph In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not…
- Clique-width In graph theory, the clique-width of a graph G is a parameter that describes the structural complexity of the graph; it is closely related to treewidth…
- Modular decomposition In graph theory, the modular decomposition is a decomposition of a graph into subsets of vertices called modules. A module is a generalization of a connected…
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…