Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Complete_coloring> ?p ?o. }
Showing items 1 to 19 of
19
with 100 items 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 wikiPageRevisionID "543792955".
- Complete_coloring hasPhotoCollection Complete_coloring.
- Complete_coloring subject Category:Graph_coloring.
- 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 label "Nombre achromatique".
- Complete_coloring label "Полная раскраска".
- Complete_coloring sameAs Nombre_achromatique.
- Complete_coloring sameAs m.0332rt.
- Complete_coloring sameAs Q3342988.
- Complete_coloring sameAs Q3342988.
- Complete_coloring wasDerivedFrom Complete_coloring?oldid=543792955.
- Complete_coloring depiction Complete_coloring_clebsch_graph.svg.
- Complete_coloring isPrimaryTopicOf Complete_coloring.
