Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q504843> ?p ?o }
- Q504843 subject Q7016011.
- Q504843 subject Q7132783.
- Q504843 subject Q7217283.
- Q504843 subject Q7481159.
- Q504843 subject Q8432158.
- Q504843 subject Q9059596.
- Q504843 abstract "In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints. In its simplest form, it is a way of coloring the vertices of a graph such that no two adjacent vertices share the same color; this is called a vertex coloring. Similarly, an edge coloring assigns a color to each edge so that no two adjacent edges share the same color, and a face coloring of a planar graph assigns a color to each face or region so that no two faces that share a boundary have the same color.Vertex coloring is the starting point of the subject, and other coloring problems can be transformed into a vertex version. For example, an edge coloring of a graph is just a vertex coloring of its line graph, and a face coloring of a plane graph is just a vertex coloring of its dual. However, non-vertex coloring problems are often stated and studied as is. That is partly for perspective, and partly because some problems are best studied in non-vertex form, as for instance is edge coloring.The convention of using colors originates from coloring the countries of a map, where each face is literally colored. This was generalized to coloring the faces of a graph embedded in the plane. By planar duality it became coloring the vertices, and in this form it generalizes to all graphs. In mathematical and computer representations, it is typical to use the first few positive or nonnegative integers as the "colors". In general, one can use any finite set as the "color set". The nature of the coloring problem depends on the number of colors but not on what they are.Graph coloring enjoys many practical applications as well as theoretical challenges. Beside the classical types of problems, different limitations can also be set on the graph, or on the way a color is assigned, or even on the color itself. It has even reached popularity with the general public in the form of the popular number puzzle Sudoku. Graph coloring is still a very active field of research.Note: Many terms used in this article are defined in Glossary of graph theory.".
- Q504843 thumbnail Petersen_graph_3-coloring.svg?width=300.
- Q504843 wikiPageExternalLink cm3119.pdf.
- Q504843 wikiPageExternalLink msb5974.
- Q504843 wikiPageExternalLink rawnet06.pdf.
- Q504843 wikiPageExternalLink 1951-01.pdf.
- Q504843 wikiPageExternalLink tutte.
- Q504843 wikiPageExternalLink citation.cfm?id=803884.
- Q504843 wikiPageExternalLink gCol.zip.
- Q504843 wikiPageExternalLink software.
- Q504843 wikiPageExternalLink gcpcodes_link.html.
- Q504843 wikiPageExternalLink podc08SW.pdf.
- Q504843 wikiPageExternalLink podcfp107_schneider_188.pdf.
- Q504843 wikiPageExternalLink cfl.pdf.
- Q504843 wikiPageExternalLink index.html.
- Q504843 wikiPageWikiLink Q1050972.
- Q504843 wikiPageWikiLink Q1060343.
- Q504843 wikiPageWikiLink Q1064349.
- Q504843 wikiPageWikiLink Q1065144.
- Q504843 wikiPageWikiLink Q1087609.
- Q504843 wikiPageWikiLink Q1120519.
- Q504843 wikiPageWikiLink Q1123036.
- Q504843 wikiPageWikiLink Q11246292.
- Q504843 wikiPageWikiLink Q1128435.
- Q504843 wikiPageWikiLink Q1130404.
- Q504843 wikiPageWikiLink Q1137554.
- Q504843 wikiPageWikiLink Q1141518.
- Q504843 wikiPageWikiLink Q118484.
- Q504843 wikiPageWikiLink Q1187620.
- Q504843 wikiPageWikiLink Q11887.
- Q504843 wikiPageWikiLink Q1190846.
- Q504843 wikiPageWikiLink Q1205074.
- Q504843 wikiPageWikiLink Q123885.
- Q504843 wikiPageWikiLink Q129239.
- Q504843 wikiPageWikiLink Q1304193.
- Q504843 wikiPageWikiLink Q131222.
- Q504843 wikiPageWikiLink Q131476.
- Q504843 wikiPageWikiLink Q1322892.
- Q504843 wikiPageWikiLink Q1325106.
- Q504843 wikiPageWikiLink Q1336170.
- Q504843 wikiPageWikiLink Q1343660.
- Q504843 wikiPageWikiLink Q1374495.
- Q504843 wikiPageWikiLink Q1378376.
- Q504843 wikiPageWikiLink Q1383936.
- Q504843 wikiPageWikiLink Q1384937.
- Q504843 wikiPageWikiLink Q1391861.
- Q504843 wikiPageWikiLink Q1396427.
- Q504843 wikiPageWikiLink Q1397646.
- Q504843 wikiPageWikiLink Q141488.
- Q504843 wikiPageWikiLink Q1441533.
- Q504843 wikiPageWikiLink Q1503724.
- Q504843 wikiPageWikiLink Q15300219.
- Q504843 wikiPageWikiLink Q1531456.
- Q504843 wikiPageWikiLink Q159430.
- Q504843 wikiPageWikiLink Q161519.
- Q504843 wikiPageWikiLink Q166507.
- Q504843 wikiPageWikiLink Q17005461.
- Q504843 wikiPageWikiLink Q17098085.
- Q504843 wikiPageWikiLink Q17118215.
- Q504843 wikiPageWikiLink Q17142035.
- Q504843 wikiPageWikiLink Q17148818.
- Q504843 wikiPageWikiLink Q17156804.
- Q504843 wikiPageWikiLink Q1734364.
- Q504843 wikiPageWikiLink Q174733.
- Q504843 wikiPageWikiLink Q176916.
- Q504843 wikiPageWikiLink Q179692.
- Q504843 wikiPageWikiLink Q1810244.
- Q504843 wikiPageWikiLink Q18207514.
- Q504843 wikiPageWikiLink Q184410.
- Q504843 wikiPageWikiLink Q187466.
- Q504843 wikiPageWikiLink Q189112.
- Q504843 wikiPageWikiLink Q193196.
- Q504843 wikiPageWikiLink Q2028293.
- Q504843 wikiPageWikiLink Q20707659.
- Q504843 wikiPageWikiLink Q208448.
- Q504843 wikiPageWikiLink Q215206.
- Q504843 wikiPageWikiLink Q2159915.
- Q504843 wikiPageWikiLink Q224787.
- Q504843 wikiPageWikiLink Q2269096.
- Q504843 wikiPageWikiLink Q2294516.
- Q504843 wikiPageWikiLink Q2393193.
- Q504843 wikiPageWikiLink Q2532492.
- Q504843 wikiPageWikiLink Q2589168.
- Q504843 wikiPageWikiLink Q266775.
- Q504843 wikiPageWikiLink Q272735.
- Q504843 wikiPageWikiLink Q2780987.
- Q504843 wikiPageWikiLink Q2835898.
- Q504843 wikiPageWikiLink Q288465.
- Q504843 wikiPageWikiLink Q2916352.
- Q504843 wikiPageWikiLink Q2984415.
- Q504843 wikiPageWikiLink Q3033506.
- Q504843 wikiPageWikiLink Q3115466.
- Q504843 wikiPageWikiLink Q3115494.
- Q504843 wikiPageWikiLink Q3115549.