Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00310184n
Noun Concept
Categories: Perfect graphs, Graph families, Graph operations
EN
cograph  Co-graph  complement-reducible graph  Complement reducible graph  cotree
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
A graph formed from another by complementation and disjoin union. Wiktionary
IS A
graph
HAS KIND
threshold graph
trivially perfect graph
Turán graph
complete bipartite graph
complete graph
STUDIED BY
graph theory
Wikipedia
EN
cograph
Wikidata
EN
Cograph
Wiktionary
EN
cograph
Wikipedia Redirections
EN
Co-graph, complement-reducible graph, Complement reducible graph, cotree, P4-free graph, P4 free graph, P 4-free graph, P 4 free graph

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License