Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Cograph> ?p ?o }
Showing triples 1 to 95 of
95
with 100 triples 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, hereditary Dacey graphs (after the related work of James C. Dacey, Jr. on orthomodular lattices), and 2-parity graphs.They have a simple structural decomposition involving disjoint union and complement graph operations that can be represented concisely by a labeled tree, and used algorithmically to efficiently solve many problems such as finding the maximum clique that are hard on more general graph classes.Special cases of the cographs include the complete graphs, complete bipartite graphs, and threshold graphs. The cographs are, in turn, special cases of the distance-hereditary graphs, comparability graphs, and perfect graphs.".
- 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 wikiPageLength "16543".
- Cograph wikiPageOutDegree "75".
- Cograph wikiPageRevisionID "708056389".
- Cograph wikiPageWikiLink Binary_relation.
- Cograph wikiPageWikiLink Category:Graph_families.
- Cograph wikiPageWikiLink Category:Graph_operations.
- Cograph wikiPageWikiLink Category:Perfect_graphs.
- Cograph wikiPageWikiLink Chordal_completion.
- Cograph wikiPageWikiLink Clique-width.
- Cograph wikiPageWikiLink Clique_(graph_theory).
- Cograph wikiPageWikiLink Clique_problem.
- Cograph wikiPageWikiLink Comparability_graph.
- Cograph wikiPageWikiLink Complement_graph.
- Cograph wikiPageWikiLink Complemented_lattice.
- Cograph wikiPageWikiLink Complete_bipartite_graph.
- Cograph wikiPageWikiLink Complete_graph.
- Cograph wikiPageWikiLink Connected_component_(graph_theory).
- Cograph wikiPageWikiLink Discrete_Applied_Mathematics.
- Cograph wikiPageWikiLink Disjoint_union.
- Cograph wikiPageWikiLink Distance-hereditary_graph.
- Cograph wikiPageWikiLink Distance_(graph_theory).
- Cograph wikiPageWikiLink Forbidden_graph_characterization.
- Cograph wikiPageWikiLink Graph_(discrete_mathematics).
- Cograph wikiPageWikiLink Graph_coloring.
- Cograph wikiPageWikiLink Graph_isomorphism.
- Cograph wikiPageWikiLink Graph_operations.
- Cograph wikiPageWikiLink Graph_theory.
- Cograph wikiPageWikiLink Hamiltonian_path_problem.
- Cograph wikiPageWikiLink Induced_path.
- Cograph wikiPageWikiLink Induced_subgraph.
- Cograph wikiPageWikiLink Information_Processing_Letters.
- Cograph wikiPageWikiLink Journal_of_Combinatorial_Theory.
- Cograph wikiPageWikiLink Journal_of_Graph_Theory.
- Cograph wikiPageWikiLink Kruskals_tree_theorem.
- Cograph wikiPageWikiLink Lexicographic_breadth-first_search.
- Cograph wikiPageWikiLink Lowest_common_ancestor.
- Cograph wikiPageWikiLink Maximal_independent_set.
- Cograph wikiPageWikiLink Modular_decomposition.
- Cograph wikiPageWikiLink NP-completeness.
- Cograph wikiPageWikiLink Partially_ordered_set.
- Cograph wikiPageWikiLink Partition_refinement.
- Cograph wikiPageWikiLink Path_(graph_theory).
- Cograph wikiPageWikiLink Perfect_graph.
- Cograph wikiPageWikiLink Permutation_graph.
- Cograph wikiPageWikiLink Planar_graph.
- Cograph wikiPageWikiLink SIAM_Journal_on_Computing.
- Cograph wikiPageWikiLink SIAM_Journal_on_Discrete_Mathematics.
- Cograph wikiPageWikiLink Separable_permutation.
- Cograph wikiPageWikiLink Series-parallel_partial_order.
- Cograph wikiPageWikiLink Shortest_path_problem.
- Cograph wikiPageWikiLink Split_decomposition.
- Cograph wikiPageWikiLink Threshold_graph.
- Cograph wikiPageWikiLink Trivially_perfect_graph.
- Cograph wikiPageWikiLink Turán_graph.
- Cograph wikiPageWikiLink Well-quasi-ordering.
- Cograph wikiPageWikiLink File:Cotree_and_cograph.svg.
- Cograph wikiPageWikiLink File:Turan_13-4.svg.
- Cograph wikiPageWikiLinkText "Cograph".
- Cograph wikiPageWikiLinkText "Complement-reducible graphs (cographs)".
- Cograph wikiPageWikiLinkText "cograph".
- Cograph title "Cograph".
- Cograph urlname "Cograph".
- Cograph wikiPageUsesTemplate Template:Citation.
- Cograph wikiPageUsesTemplate Template:Harvtxt.
- Cograph wikiPageUsesTemplate Template:Math.
- Cograph wikiPageUsesTemplate Template:Mathworld.
- Cograph wikiPageUsesTemplate Template:Mvar.
- Cograph wikiPageUsesTemplate Template:Refbegin.
- Cograph wikiPageUsesTemplate Template:Refend.
- Cograph wikiPageUsesTemplate Template:Reflist.
- Cograph wikiPageUsesTemplate Template:Sfnp.
- Cograph subject Category:Graph_families.
- Cograph subject Category:Graph_operations.
- Cograph subject Category:Perfect_graphs.
- Cograph hypernym Graph.
- Cograph type Software.
- Cograph type Graph.
- 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 "Cograph".
- Cograph sameAs Q5141281.
- Cograph sameAs Co-Graph.
- Cograph sameAs Cographe.
- Cograph sameAs Kograf.
- Cograph sameAs m.04dlnr.
- Cograph sameAs Кограф.
- Cograph sameAs Q5141281.
- Cograph wasDerivedFrom Cograph?oldid=708056389.
- Cograph depiction Turan_13-4.svg.
- Cograph isPrimaryTopicOf Cograph.