Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Dually_chordal_graph> ?p ?o }
Showing triples 1 to 45 of
45
with 100 triples per page.
- Dually_chordal_graph abstract "In the mathematical area of graph theory, an undirected graph G is dually chordal if the hypergraph of its maximal cliques is a hypertree. The name comes from the fact that a graph is chordal if and only if the hypergraph of its maximal cliques is the dual of a hypertree. Originally, these graphs were defined by maximum neighborhood orderings and have a variety of different characterizations - see e.g.. Unlike for chordal graphs, the property of being dually chordal is not hereditary, i.e., induced subgraphs of a dually chordal graph are not necessarily dually chordal (hereditarily dually chordal graphs are exactly the strongly chordal graphs), and a dually chordal graph is in general not a perfect graph. Dually chordal graphs appeared first under the name HT-graphs in.".
- Dually_chordal_graph wikiPageID "49621181".
- Dually_chordal_graph wikiPageLength "7888".
- Dually_chordal_graph wikiPageOutDegree "37".
- Dually_chordal_graph wikiPageRevisionID "708204337".
- Dually_chordal_graph wikiPageWikiLink Category:Graph_families.
- Dually_chordal_graph wikiPageWikiLink Category:Perfect_graphs.
- Dually_chordal_graph wikiPageWikiLink Chordal_graph.
- Dually_chordal_graph wikiPageWikiLink Clique.
- Dually_chordal_graph wikiPageWikiLink Clique_Cover.
- Dually_chordal_graph wikiPageWikiLink Clique_graph.
- Dually_chordal_graph wikiPageWikiLink Coloring.
- Dually_chordal_graph wikiPageWikiLink Comput._Sci._J._of_Moldova_(Kishinev).
- Dually_chordal_graph wikiPageWikiLink Discrete_Applied_Mathematics.
- Dually_chordal_graph wikiPageWikiLink Discrete_Math._(Moscow).
- Dually_chordal_graph wikiPageWikiLink Dominating_Set.
- Dually_chordal_graph wikiPageWikiLink Eduard_Helly.
- Dually_chordal_graph wikiPageWikiLink Efficient_Domination.
- Dually_chordal_graph wikiPageWikiLink Efficient_Edge_Domination.
- Dually_chordal_graph wikiPageWikiLink Elsevier.
- Dually_chordal_graph wikiPageWikiLink European_Journal_of_Combinatorics.
- Dually_chordal_graph wikiPageWikiLink Graph_(discrete_mathematics).
- Dually_chordal_graph wikiPageWikiLink Graph_theory.
- Dually_chordal_graph wikiPageWikiLink Hypertree.
- Dually_chordal_graph wikiPageWikiLink Independent_set.
- Dually_chordal_graph wikiPageWikiLink Journal_of_Graph_Theory.
- Dually_chordal_graph wikiPageWikiLink Lecture_Notes_in_Computer_Science.
- Dually_chordal_graph wikiPageWikiLink Mathematics.
- Dually_chordal_graph wikiPageWikiLink NP-completeness.
- Dually_chordal_graph wikiPageWikiLink Network.
- Dually_chordal_graph wikiPageWikiLink Perfect_graph.
- Dually_chordal_graph wikiPageWikiLink SIAM_Journal_on_Discrete_Mathematics.
- Dually_chordal_graph wikiPageWikiLink Steiner_Tree.
- Dually_chordal_graph wikiPageWikiLink Strongly_chordal_graph.
- Dually_chordal_graph wikiPageWikiLinkText "dually chordal graph".
- Dually_chordal_graph wikiPageUsesTemplate Template:Citation.
- Dually_chordal_graph wikiPageUsesTemplate Template:Orphan.
- Dually_chordal_graph wikiPageUsesTemplate Template:Reflist.
- Dually_chordal_graph subject Category:Graph_families.
- Dually_chordal_graph subject Category:Perfect_graphs.
- Dually_chordal_graph hypernym Hypertree.
- Dually_chordal_graph comment "In the mathematical area of graph theory, an undirected graph G is dually chordal if the hypergraph of its maximal cliques is a hypertree. The name comes from the fact that a graph is chordal if and only if the hypergraph of its maximal cliques is the dual of a hypertree. Originally, these graphs were defined by maximum neighborhood orderings and have a variety of different characterizations - see e.g..".
- Dually_chordal_graph label "Dually chordal graph".
- Dually_chordal_graph wasDerivedFrom Dually_chordal_graph?oldid=708204337.
- Dually_chordal_graph isPrimaryTopicOf Dually_chordal_graph.