DBpedia 2015-10

Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Strong_perfect_graph_theorem> ?p ?o }

Showing triples 1 to 78 of 78 with 100 triples per page.

Strong_perfect_graph_theorem abstract "In graph theory, the strong perfect graph theorem is a forbidden graph characterization of the perfect graphs as being exactly the graphs that have neither odd holes (odd-length induced cycles) nor odd antiholes (complements of odd holes). It was conjectured by Claude Berge in 1961. A proof by Maria Chudnovsky, Neil Robertson, Paul Seymour, and Robin Thomas was announced in 2002 and published by them in 2006.The proof of the strong perfect graph theorem won for its authors a $10,000 prize offered by Gérard Cornuéjols of Carnegie Mellon University and the 2009 Fulkerson Prize.".
Strong_perfect_graph_theorem wikiPageExternalLink pds.pdf.
Strong_perfect_graph_theorem wikiPageExternalLink icm2002.3.0547.0560.ocr.pdf.
Strong_perfect_graph_theorem wikiPageExternalLink p02.xhtml.
Strong_perfect_graph_theorem wikiPageExternalLink spgt.html.
Strong_perfect_graph_theorem wikiPageID "744171".
Strong_perfect_graph_theorem wikiPageLength "15171".
Strong_perfect_graph_theorem wikiPageOutDegree "46".
Strong_perfect_graph_theorem wikiPageRevisionID "683711000".
Strong_perfect_graph_theorem wikiPageWikiLink Annals_of_Mathematics.
Strong_perfect_graph_theorem wikiPageWikiLink Bipartite_graph.
Strong_perfect_graph_theorem wikiPageWikiLink Category:Perfect_graphs.
Strong_perfect_graph_theorem wikiPageWikiLink Category:Theorems_in_graph_theory.
Strong_perfect_graph_theorem wikiPageWikiLink Chordal_graph.
Strong_perfect_graph_theorem wikiPageWikiLink Chromatic_index.
Strong_perfect_graph_theorem wikiPageWikiLink Claude_Berge.
Strong_perfect_graph_theorem wikiPageWikiLink Clique_(graph_theory).
Strong_perfect_graph_theorem wikiPageWikiLink Comparability_graph.
Strong_perfect_graph_theorem wikiPageWikiLink Complement_graph.
Strong_perfect_graph_theorem wikiPageWikiLink Complete_bipartite_graph.
Strong_perfect_graph_theorem wikiPageWikiLink Cycle_graph.
Strong_perfect_graph_theorem wikiPageWikiLink Degree_(graph_theory).
Strong_perfect_graph_theorem wikiPageWikiLink Discrete_Mathematics_(journal).
Strong_perfect_graph_theorem wikiPageWikiLink Edge_coloring.
Strong_perfect_graph_theorem wikiPageWikiLink Forbidden_graph_characterization.
Strong_perfect_graph_theorem wikiPageWikiLink Fulkerson_Prize.
Strong_perfect_graph_theorem wikiPageWikiLink Glossary_of_graph_theory.
Strong_perfect_graph_theorem wikiPageWikiLink Graph_coloring.
Strong_perfect_graph_theorem wikiPageWikiLink Graph_theory.
Strong_perfect_graph_theorem wikiPageWikiLink Independent_set_(graph_theory).
Strong_perfect_graph_theorem wikiPageWikiLink Induced_cycle.
Strong_perfect_graph_theorem wikiPageWikiLink Induced_path.
Strong_perfect_graph_theorem wikiPageWikiLink Induced_subgraph.
Strong_perfect_graph_theorem wikiPageWikiLink Journal_of_Combinatorial_Theory.
Strong_perfect_graph_theorem wikiPageWikiLink Kxc3xb6nigs_theorem_(graph_theory).
Strong_perfect_graph_theorem wikiPageWikiLink Line_graph.
Strong_perfect_graph_theorem wikiPageWikiLink László_Lovász.
Strong_perfect_graph_theorem wikiPageWikiLink Maria_Chudnovsky.
Strong_perfect_graph_theorem wikiPageWikiLink Matching_(graph_theory).
Strong_perfect_graph_theorem wikiPageWikiLink Maximum_clique.
Strong_perfect_graph_theorem wikiPageWikiLink Maximum_independent_set.
Strong_perfect_graph_theorem wikiPageWikiLink Maximum_matching.
Strong_perfect_graph_theorem wikiPageWikiLink Modular_decomposition.
Strong_perfect_graph_theorem wikiPageWikiLink Neil_Robertson_(mathematician).
Strong_perfect_graph_theorem wikiPageWikiLink Paul_Seymour_(mathematician).
Strong_perfect_graph_theorem wikiPageWikiLink Perfect_graph.
Strong_perfect_graph_theorem wikiPageWikiLink Perfect_graph_theorem.
Strong_perfect_graph_theorem wikiPageWikiLink Robin_Thomas_(mathematician).
Strong_perfect_graph_theorem wikiPageWikiLink Science_(journal).
Strong_perfect_graph_theorem wikiPageWikiLink Skew_partition.
Strong_perfect_graph_theorem wikiPageWikiLink Split_graph.
Strong_perfect_graph_theorem wikiPageWikiLink Vašek_Chvátal.
Strong_perfect_graph_theorem wikiPageWikiLink Vertex_cover.
Strong_perfect_graph_theorem wikiPageWikiLink Vertex_cover_problem.
Strong_perfect_graph_theorem wikiPageWikiLink Václav_Chvátal.
Strong_perfect_graph_theorem wikiPageWikiLink Wheel_graph.
Strong_perfect_graph_theorem wikiPageWikiLinkText "Strong perfect graph theorem".
Strong_perfect_graph_theorem wikiPageWikiLinkText "strong perfect graph theorem".
Strong_perfect_graph_theorem hasPhotoCollection Strong_perfect_graph_theorem.
Strong_perfect_graph_theorem title "Strong Perfect Graph Theorem".
Strong_perfect_graph_theorem urlname "StrongPerfectGraphTheorem".
Strong_perfect_graph_theorem wikiPageUsesTemplate Template:Citation.
Strong_perfect_graph_theorem wikiPageUsesTemplate Template:Cite_journal.
Strong_perfect_graph_theorem wikiPageUsesTemplate Template:Harvtxt.
Strong_perfect_graph_theorem wikiPageUsesTemplate Template:Mathworld.
Strong_perfect_graph_theorem wikiPageUsesTemplate Template:Reflist.
Strong_perfect_graph_theorem subject Category:Perfect_graphs.
Strong_perfect_graph_theorem subject Category:Theorems_in_graph_theory.
Strong_perfect_graph_theorem hypernym Characterization.
Strong_perfect_graph_theorem type Graph.
Strong_perfect_graph_theorem type Theorem.
Strong_perfect_graph_theorem comment "In graph theory, the strong perfect graph theorem is a forbidden graph characterization of the perfect graphs as being exactly the graphs that have neither odd holes (odd-length induced cycles) nor odd antiholes (complements of odd holes). It was conjectured by Claude Berge in 1961.".
Strong_perfect_graph_theorem label "Strong perfect graph theorem".
Strong_perfect_graph_theorem sameAs m.0kvc0nk.
Strong_perfect_graph_theorem sameAs Q17156804.
Strong_perfect_graph_theorem sameAs Q17156804.
Strong_perfect_graph_theorem wasDerivedFrom Strong_perfect_graph_theorem?oldid=683711000.
Strong_perfect_graph_theorem isPrimaryTopicOf Strong_perfect_graph_theorem.