Path coloring
id:
path-coloring-303-16484141
title:
Path coloring
text:
In graph theory, path coloring usually refers to one of two problems: The problem of coloring a (multi)set of paths R in graph G , in such a way that any two paths of R which share an edge in G receive different colors. Set R and graph G are provided at input. This formulation is equivalent to vertex coloring the conflict graph of set R , i.e. a graph with vertex set R and edges connecting all pairs of paths of R which are not edge-disjoint with respect to G .
The problem of coloring any chosen
brand slug:
wiki
category slug:
encyclopedia
description:
Concept in graph theory
original url:
https://en.wikipedia.org/wiki/Path_coloring
date created:
date modified:
2023-08-11T17:49:31Z
main entity:
{"identifier":"Q7144647","url":"https://www.wikidata.org/entity/Q7144647"}
image:
fields total:
13
integrity:
14