The NP-Completeness of Edge-Coloring

DOI: 10.1137/0210055

SIAM Journal on Computing

Data up to Jan 2025

Published1981

Citations1,135

References2

Fields

Mathematics Computer science Combinatorics Discrete mathematics Mathematical analysis

Total Citations Per Year

Abstract

References (2)

Edge-colourings of graphs

1978 • 140 citations

Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable

1975 • 122 citations

Cited By (0)

Loading...