Cograph

• Can be constructed from isolated vertices by complement, joint union and disjoint union.
• Can be decomposed by isolated vertex elimination and complement.
• It contains no induced path of length at least 4.
• The maximum distance between two vertices in the same connected component is at most 2.
• Has at least one pair of false or true twins (that have the same opened or closed neighbourhood).

Properties

• Polynomial recognition time:
• :Since it has a characterization by a finite number of forbidden subgraphs.

<< Previous Word Browser Next >>
carlota perez arsenicosis concept2 prodi commission buckley (disambiguation) william hendricks ngatea national democrats (uk) national democrats (sweden) kaknstornet genital tubercle	victor hasselblad international transpersonal association operation longstreet list of sports teams in toronto great south road, new zealand renaissance fair new caledonia (canada) the greenway complement (graph theory) labour movement anya schiffrin	northern outfall sewer let's get it on lower queen (ttc) david penney operation silverado freddie franklin boris zivkovic united country party here, my dear argo 16 operation ivy lightning	hms solebay 3c e hms barfleur hms barossa frank stallone st mary of the angels hms camperdown yellow shouldered parrot science.ca website socially responsible investing albert szirmai