ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
28
views
0
references
Top references
cited by
140
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,779
similar
All similar
Record
: found
Abstract
: not found
Article
: not found
The NP-Completeness of Edge-Coloring
Author(s):
Ian Holyer
Publication date
Created:
November 1981
Publication date
(Print):
November 1981
Journal:
SIAM Journal on Computing
Read this article at
ScienceOpen
Publisher
Review
Review article
Invite someone to review
Bookmark
Cite as...
There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.
Abstract
Related collections
ScienceOpen Research
Author and article information
Journal
Title:
SIAM Journal on Computing
Abbreviated Title:
SIAM J. Comput.
ISSN (Print):
0097-5397
ISSN (Electronic):
1095-7111
Publication date Created:
November 1981
Publication date (Print):
November 1981
Volume
: 10
Issue
: 4
Pages
: 718-720
Article
DOI:
10.1137/0210055
SO-VID:
69cee57a-c54e-465b-bffe-44fcf18ff37b
Copyright ©
© 1981
History
Data availability:
Comments
Comment on this article
Sign in to comment
scite_
Similar content
2,779
Experimental excitation functions for (n, p), (n, t), (n, α), (n, 2n), (n, np), and (n, nα) reactions
Authors:
P. Jessen
,
M. Bormann
,
F. Dreyer
…
Melanin-Mediated Synthesis of Copper Oxide Nanoparticles and Preparation of Functional Agar/CuO NP Nanocomposite Films
Authors:
Swarup Roy
,
Jong-Whan Rhim
A simple, but NP-hard, motion planning problem
Authors:
See all similar
Cited by
146
Link scheduling in polynomial time
Authors:
B. Hajek
,
G. Sasaki
The NP-completeness column: an ongoing guide
Authors:
David Johnson
Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
Authors:
Hans L. Bodlaender
See all cited by