Algorithms and Bounds for Very Strong Rainbow Coloring

L. S Chandran, A. D., & Issac, D. (2025). Algorithms and Bounds for Very Strong Rainbow Coloring.

Type

Unclassified

Intellectual base

Unclassified

Year

2025

DOI

10.1007/s40840-025-01876-8

Link

https://doi.org/10.1007/s40840-025-01876-8

Cited by

1 citation across 1 artifact.

Domain-specific

• Rainbow coloring
  • The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:fe8e6da5b526 · see in the full table