Matches in DBpedia 2016-04 for { ?s ?p "In mathematics, list edge-coloring is a type of graph coloring that combines list coloring and edge coloring.An instance of a list edge-coloring problem consists of a graph together with a list of allowed colors for each edge. A list edge-coloring is a choice of a color for each edge, from its list of allowed colors; a coloring is proper if no two adjacent edges receive the same color.A graph G is k-edge-choosable if every instance of list edge-coloring that has G as its underlying graph and that provides at least k allowed colors for each edge of G has a proper coloring.The edge choosability, or list edge colorability, list edge chromatic number, or list chromatic index, ch′(G) of graph G is the least number k such that G is k-edge-choosable."@en }
Showing triples 1 to 2 of
2
with 100 triples per page.
- List_edge-coloring abstract "In mathematics, list edge-coloring is a type of graph coloring that combines list coloring and edge coloring.An instance of a list edge-coloring problem consists of a graph together with a list of allowed colors for each edge. A list edge-coloring is a choice of a color for each edge, from its list of allowed colors; a coloring is proper if no two adjacent edges receive the same color.A graph G is k-edge-choosable if every instance of list edge-coloring that has G as its underlying graph and that provides at least k allowed colors for each edge of G has a proper coloring.The edge choosability, or list edge colorability, list edge chromatic number, or list chromatic index, ch′(G) of graph G is the least number k such that G is k-edge-choosable.".
- Q15300219 abstract "In mathematics, list edge-coloring is a type of graph coloring that combines list coloring and edge coloring.An instance of a list edge-coloring problem consists of a graph together with a list of allowed colors for each edge. A list edge-coloring is a choice of a color for each edge, from its list of allowed colors; a coloring is proper if no two adjacent edges receive the same color.A graph G is k-edge-choosable if every instance of list edge-coloring that has G as its underlying graph and that provides at least k allowed colors for each edge of G has a proper coloring.The edge choosability, or list edge colorability, list edge chromatic number, or list chromatic index, ch′(G) of graph G is the least number k such that G is k-edge-choosable.".