Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Cograph> ?p ?o. }
Showing items 1 to 39 of
39
with 100 items per page.
- Cograph abstract "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.Cographs have been discovered independently by several authors since the 1970s; early references include Jung (1978), Lerchs (1971), Seinsche (1974), and Sumner (1974). They have also been called D*-graphs (Jung 1978), hereditary Dacey graphs (after the related work of James C. Dacey, Jr. on orthomodular lattices; see Sumner 1974), and 2-parity graphs (Burlet & Uhry 1984).See, e.g., Brandstädt, Le & Spinrad (1999) for more detailed coverage of cographs, including the facts presented here.".
- Cograph thumbnail Turan_13-4.svg?width=300.
- Cograph wikiPageExternalLink www.graphclasses.org.
- Cograph wikiPageExternalLink gc_151.html.
- Cograph wikiPageExternalLink DAM-cographs.pdf.
- Cograph wikiPageID "1175666".
- Cograph wikiPageRevisionID "602778296".
- Cograph hasPhotoCollection Cograph.
- Cograph title "Cograph".
- Cograph urlname "Cograph".
- Cograph subject Category:Graph_families.
- Cograph subject Category:Graph_operations.
- Cograph subject Category:Perfect_graphs.
- Cograph type Abstraction100002137.
- Cograph type Action114006945.
- Cograph type Attribute100024264.
- Cograph type Communication100033020.
- Cograph type Graph107000195.
- Cograph type GraphOperations.
- Cograph type Operation114008806.
- Cograph type PerfectGraphs.
- Cograph type State100024720.
- Cograph type VisualCommunication106873252.
- Cograph comment "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.Cographs have been discovered independently by several authors since the 1970s; early references include Jung (1978), Lerchs (1971), Seinsche (1974), and Sumner (1974).".
- Cograph label "Co-Graph".
- Cograph label "Cograph".
- Cograph label "Cographe".
- Cograph label "Kograf".
- Cograph label "Кограф".
- Cograph sameAs Co-Graph.
- Cograph sameAs Cographe.
- Cograph sameAs Kograf.
- Cograph sameAs m.04dlnr.
- Cograph sameAs Q5141281.
- Cograph sameAs Q5141281.
- Cograph sameAs Cograph.
- Cograph wasDerivedFrom Cograph?oldid=602778296.
- Cograph depiction Turan_13-4.svg.
- Cograph isPrimaryTopicOf Cograph.
