File:The trailing path algorithm. .png
Summary
| Description |
English: The figures illustrate a demonstrative example of how the trailing path algorithm operates. Here, the ‘trailing path algorithm’ leads to four possible degenerate paths (in the second iterative step), which eventually results in the same number of minimum colors required to color the graph, though leading to the attainment of two alternative colormaps, yet returning the same chromatic number. |
| Date | |
| Source | Own work |
| Author | Nemo8130 |
Licensing
I, the copyright holder of this work, hereby publish it under the following license:
This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
