Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Oriented_coloring> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Oriented_coloring abstract "In graph theory, oriented graph coloring is a special type of graph coloring. Namely, it isan assignment of colors to vertices of an oriented graph that is proper: no two adjacent vertices get the same color, and respects the orientation: if (x, y) and (u, v) are arcs of the graph then it is not possible that colors of x and v and of y and u are the same.An oriented chromatic number of a graph G is the least number of colors needed in an oriented coloring;it is usually denoted by . The same definition can be extended to undirected graphs, as well, by defining the oriented chromatic number of an undirected graph to be the largest oriented chromatic number of any of its orientations.".
- Oriented_coloring wikiPageID "12606685".
- Oriented_coloring wikiPageRevisionID "505633307".
- Oriented_coloring hasPhotoCollection Oriented_coloring.
- Oriented_coloring subject Category:Graph_coloring.
- Oriented_coloring comment "In graph theory, oriented graph coloring is a special type of graph coloring. Namely, it isan assignment of colors to vertices of an oriented graph that is proper: no two adjacent vertices get the same color, and respects the orientation: if (x, y) and (u, v) are arcs of the graph then it is not possible that colors of x and v and of y and u are the same.An oriented chromatic number of a graph G is the least number of colors needed in an oriented coloring;it is usually denoted by .".
- Oriented_coloring label "Oriented coloring".
- Oriented_coloring sameAs m.02wxnk2.
- Oriented_coloring sameAs Q7102417.
- Oriented_coloring sameAs Q7102417.
- Oriented_coloring wasDerivedFrom Oriented_coloring?oldid=505633307.
- Oriented_coloring isPrimaryTopicOf Oriented_coloring.