{"version":"1.0","type":"link","title":"Cograph - Newikis","description":"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…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/1/1b/Turan_13-4.svg/1280px-Turan_13-4.svg.png","thumbnail_width":1280,"thumbnail_height":1280}