eCommons

 

Graph Minimal Uncolorability is $D_{p}$-Complete

Other Titles

Abstract

In their excellent paper, C.H. Papadimitriou and M. Yannakakis [PY] asked whether the minimal-3-uncolorability problem is, among other Critical Problems, Dp-complete. This paper gives an affirmative answer to the above question. We show that minimal-k-uncolorability is Dp-complete, for all fixed k≥3. Furthermore, for k = 3, the reduction can be modified by using "sensitive" gadgets to resolve the planar case, bounded vertex degree case and their combination.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1985-06

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR85-688

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record