The NP-Completeness of Edge-Coloring

Holyer, I. (1981). The NP-Completeness of Edge-Coloring. SIAM Journal on Computing, 10(4).

Type

Journal article

Intellectual base

Primary research

Year

1981

Volume

10

Issue

4

DOI

10.1137/0210055

DOI registrant

Society for Industrial & Applied Mathematics

Link

https://epubs.siam.org/doi/10.1137/0210055

Cited by

1 citation across 1 artifact.

Domain-specific

• Edge Coloring
  • Holyer's original paper proves NP-completeness of determining chromatic index even for cubic graphs under the standard decision framing.

Verification

Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:b11da74eb70c · see in the full table