https://github.com/permutationlock/implpathcol_paper
Implementation details of algorithms to path color plane graphs
https://github.com/permutationlock/implpathcol_paper
Last synced: about 2 months ago
JSON representation
Implementation details of algorithms to path color plane graphs
- Host: GitHub
- URL: https://github.com/permutationlock/implpathcol_paper
- Owner: permutationlock
- Created: 2018-01-18T08:39:59.000Z (over 8 years ago)
- Default Branch: master
- Last Pushed: 2025-04-22T19:25:43.000Z (about 1 year ago)
- Last Synced: 2025-04-22T20:34:54.164Z (about 1 year ago)
- Language: TeX
- Size: 3.85 MB
- Stars: 0
- Watchers: 4
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Path-Coloring Algorithms for Plane Graphs
A *path coloring* of a graph G is a vertex coloring
of G such that each color class induces a disjoint union of paths.
We present two efficient algorithms
to construct a path coloring of a plane graph.
The first algorithm, based on a proof of Poh,
is given a plane graph;
it produces a path coloring of the given graph
using three colors.
The second algorithm,
based on similar proofs
by Hartman
and Skrekovski,
performs a list-coloring generalization of the above.
The algorithm is given a plane graph and an assignment of lists of
three colors to each vertex;
it produces a path coloring of the given graph
in which each vertex receives a color from its list.
[Implementations are available][1] for all algorithms that are described.
[1]: https://github.com/permutationlock/libavengraph