• Cite Icon1275
  • https://doi.org/10.1137/0210055Copy DOI Icon

The NP-Completeness of Edge-Coloring

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We show that it is NP-complete to determine the chromatic index of an arbitrary graph. The problem remains NP-complete even for cubic graphs.

Similar Papers
  • Research Article
  • Citations221

Total Ordering Problem

  • Feb 01, 1979
  • SIAM Journal on Computing
  • J Opatrny
  • Research Article
  • Citations199

The Pathwidth and Treewidth of Cographs

  • May 01, 1993
  • SIAM Journal on Discrete Mathematics
  • Hans L Bodlaender +1
  • Research Article
  • Citations338

Nondeterminism within $P^ * $

  • Jun 01, 1993
  • SIAM Journal on Computing
  • Jonathan F Buss +1
  • Research Article
  • Citations55

An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem

  • Dec 01, 1993
  • SIAM Journal on Computing
  • Jiazhen Cai +2
  • Research Article
  • Citations155

Condition Estimates

  • Jun 01, 1984
  • SIAM Journal on Scientific and Statistical Computing
  • William W Hager
  • Research Article
  • Citations363

On the Complexity of Computing the Volume of a Polyhedron

  • Oct 01, 1988
  • SIAM Journal on Computing
  • M E Dyer +1
  • Research Article
  • Citations3353

The Numerical Solution of Parabolic and Elliptic Differential Equations

  • Mar 01, 1955
  • Journal of the Society for Industrial and Applied Mathematics
  • D W Peaceman +1
  • Research Article
  • Citations12

Induced Matchings in Subcubic Planar Graphs

  • Jan 01, 2012
  • SIAM Journal on Discrete Mathematics
  • Ross J Kang +2
  • Research Article
  • Citations569

An Algorithm for the Inversion of Finite Toeplitz Matrices

  • Sep 01, 1964
  • Journal of the Society for Industrial and Applied Mathematics
  • William F Trench
  • Research Article
  • Citations116

A Graph-Theoretic Approach to a Communications Problem

  • Jul 01, 1966
  • SIAM Journal on Applied Mathematics
  • Gary Chartrand
  • Research Article
  • Citations2466

Bounds on Multiprocessing Timing Anomalies

  • Mar 01, 1969
  • SIAM Journal on Applied Mathematics
  • R L Graham
  • Research Article
  • Citations432

A Method for Constructing Local Monotone Piecewise Cubic Interpolants

  • Jun 01, 1984
  • SIAM Journal on Scientific and Statistical Computing
  • F N Fritsch +1
  • Research Article
  • Citations106

The Solution of the Riemann Problem for a Hyperbolic System of Conservation Laws Modeling Polymer Flooding

  • May 01, 1988
  • SIAM Journal on Mathematical Analysis
  • Thormod Johansen +1
  • Research Article
  • Citations30737

An Algorithm for Least-Squares Estimation of Nonlinear Parameters

  • Jun 01, 1963
  • Journal of the Society for Industrial and Applied Mathematics
  • Donald W Marquardt
  • Research Article
  • Citations102

Rapid Multiplication of Rectangular Matrices

  • Aug 01, 1982
  • SIAM Journal on Computing
  • D Coppersmith
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.