Skip to search formSkip to main contentSkip to account menu

Path coloring

In graph theory, path coloring usually refers to one of two problems: * The problem of coloring a (multi)set of paths in graph , in such a way that… 
Wikipedia (opens in a new tab)

Related topics

Related topics

8 relations
Directed graphEdge coloringGraph theoryIncidence coloring

Broader (1)

Graph coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Carving-decomposition based algorithms for the maximum path coloring problem
  • M. BashirQ. Gu
  • IEEE International Conference on Communications…
  • 2012
  • Corpus ID: 24861768
Given a set P of paths in a graph G and k colors, the maximum path coloring (Max-PC) problem is to find a maximum subset of P and… 
2006
2006
Path Coloring on Binary Caterpillars
The path coloring problem is to assign the minimum number of colors to a given set of directed paths on a given symmetric digraph… 
Review
2006
Review
2006
Approximation Algorithms for Path Coloring in Trees
The study of the path coloring problem is motivated by the allocation of optical bandwidth to communication requests in all… 
2004
2004
Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks
Motivated by the wavelength assignment problem in WDM optical networks, we study path coloring problems in graphs. Given a set of… 
2003
2003
Distributed Soft Path Coloring
In a soft coloring of a graph, a few adjacent vertices may receive the same color. We study soft coloring in the distributed… 
2003
2003
Satisfying a maximum number of pre-routed requests in all-optical rings
2003
2003
Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees
Motivated by the problem of allocating optical bandwidth in tree–shaped WDM networks, we study the fractional path coloring… 
2001
2001
Fractional path coloring on bounded degree trees
This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a… 
2001
2001
New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs
Path problems such as the maximum edge-disjoint paths problem, the path coloring problem,and the maximum path coloring problem… 
2000
2000
A 2-Approximation Algorithm for Path Coloring on Trees of Rings
A tree of rings is an undirected graph obtained from a tree by replacing each node of the tree with a cycle and then contracting… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)