Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Complete_coloring> ?p ?o }
Showing triples 1 to 51 of
51
with 100 triples per page.
- Complete_coloring abstract "In graph theory, complete coloring is the opposite of harmonious coloring in the sense that it is a vertex coloring in which every pair of colors appears on at least one pair of adjacent vertices. Equivalently, a complete coloring is minimal in the sense that it cannot be transformed into a proper coloring with fewer colors by merging pairs of color classes. The achromatic number ψ(G) of a graph G is the maximum number of colors possible in any complete coloring of G.".
- Complete_coloring thumbnail Complete_coloring_clebsch_graph.svg?width=300.
- Complete_coloring wikiPageExternalLink biblio.html.
- Complete_coloring wikiPageExternalLink node17.html.
- Complete_coloring wikiPageID "690736".
- Complete_coloring wikiPageLength "5113".
- Complete_coloring wikiPageOutDegree "21".
- Complete_coloring wikiPageRevisionID "608423338".
- Complete_coloring wikiPageWikiLink Approximation_algorithm.
- Complete_coloring wikiPageWikiLink Approximation_ratio.
- Complete_coloring wikiPageWikiLink Bipartite_graph.
- Complete_coloring wikiPageWikiLink Category:Graph_coloring.
- Complete_coloring wikiPageWikiLink Clebsch_graph.
- Complete_coloring wikiPageWikiLink Cograph.
- Complete_coloring wikiPageWikiLink Complement_graph.
- Complete_coloring wikiPageWikiLink Decision_problem.
- Complete_coloring wikiPageWikiLink Disjoint_sets.
- Complete_coloring wikiPageWikiLink Graph_coloring.
- Complete_coloring wikiPageWikiLink Graph_complement.
- Complete_coloring wikiPageWikiLink Graph_theory.
- Complete_coloring wikiPageWikiLink Harmonious_coloring.
- Complete_coloring wikiPageWikiLink Hypercube_graph.
- Complete_coloring wikiPageWikiLink Independent_set_(graph_theory).
- Complete_coloring wikiPageWikiLink Interval_graph.
- Complete_coloring wikiPageWikiLink NP-complete.
- Complete_coloring wikiPageWikiLink NP-completeness.
- Complete_coloring wikiPageWikiLink NP-hard.
- Complete_coloring wikiPageWikiLink NP-hardness.
- Complete_coloring wikiPageWikiLink Optimization_problem.
- Complete_coloring wikiPageWikiLink Partition_of_a_set.
- Complete_coloring wikiPageWikiLink File:Complete_coloring_clebsch_graph.svg.
- Complete_coloring wikiPageWikiLinkText "Complete coloring".
- Complete_coloring wikiPageWikiLinkText "achromatic number".
- Complete_coloring wikiPageWikiLinkText "complete coloring".
- Complete_coloring wikiPageWikiLinkText "complete".
- Complete_coloring wikiPageWikiLinkText "minimal".
- Complete_coloring hasPhotoCollection Complete_coloring.
- Complete_coloring wikiPageUsesTemplate Template:Reflist.
- Complete_coloring subject Category:Graph_coloring.
- Complete_coloring hypernym Opposite.
- Complete_coloring comment "In graph theory, complete coloring is the opposite of harmonious coloring in the sense that it is a vertex coloring in which every pair of colors appears on at least one pair of adjacent vertices. Equivalently, a complete coloring is minimal in the sense that it cannot be transformed into a proper coloring with fewer colors by merging pairs of color classes. The achromatic number ψ(G) of a graph G is the maximum number of colors possible in any complete coloring of G.".
- Complete_coloring label "Complete coloring".
- Complete_coloring sameAs Nombre_achromatique.
- Complete_coloring sameAs Coloração_completa.
- Complete_coloring sameAs m.0332rt.
- Complete_coloring sameAs Полная_раскраска.
- Complete_coloring sameAs Q3342988.
- Complete_coloring sameAs Q3342988.
- Complete_coloring wasDerivedFrom Complete_coloring?oldid=608423338.
- Complete_coloring depiction Complete_coloring_clebsch_graph.svg.
- Complete_coloring isPrimaryTopicOf Complete_coloring.