Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5477527> ?p ?o }
Showing triples 1 to 18 of
18
with 100 triples per page.
- Q5477527 subject Q7016011.
- Q5477527 abstract "Fractional coloring is a topic in a young branch of graph theory known as fractional graph theory. It is a generalization of ordinary graph coloring. In a traditional graph coloring, each vertex in a graph is assigned some color, and adjacent vertices — those connected by edges — must be assigned different colors. In a fractional coloring however, a set of colors is assigned to each vertex of a graph. The requirement about adjacent vertices still holds, so if two vertices are joined by an edge, they must have no colors in common.Fractional graph coloring can be viewed as the linear programming relaxation of traditional graph coloring. Indeed, fractional coloring problems are much more amenable to a linear programming approach than traditional coloring problems.".
- Q5477527 thumbnail Graph_fractional_coloring.svg?width=300.
- Q5477527 wikiPageWikiLink Q1060343.
- Q5477527 wikiPageWikiLink Q1137554.
- Q5477527 wikiPageWikiLink Q131476.
- Q5477527 wikiPageWikiLink Q1512771.
- Q5477527 wikiPageWikiLink Q166507.
- Q5477527 wikiPageWikiLink Q1934099.
- Q5477527 wikiPageWikiLink Q202843.
- Q5477527 wikiPageWikiLink Q2275559.
- Q5477527 wikiPageWikiLink Q504843.
- Q5477527 wikiPageWikiLink Q7016011.
- Q5477527 wikiPageWikiLink Q761631.
- Q5477527 wikiPageWikiLink Q7624553.
- Q5477527 comment "Fractional coloring is a topic in a young branch of graph theory known as fractional graph theory. It is a generalization of ordinary graph coloring. In a traditional graph coloring, each vertex in a graph is assigned some color, and adjacent vertices — those connected by edges — must be assigned different colors. In a fractional coloring however, a set of colors is assigned to each vertex of a graph.".
- Q5477527 label "Fractional coloring".
- Q5477527 depiction Graph_fractional_coloring.svg.