On the \(k\)-coloring of intervals
type: Item
instance of: scholarly article
title: On the \(k\)-coloring of intervals
zbMATH Open document ID: 0826.68092
DOI: 10.1016/0166-218X(93)E0174-W
author: Martin C. Carlisle
author: Errol L. Lloyd
published in: Discrete Applied Mathematics
publication date: 1995-11-20T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 769294
zbMATH Keywords: \(k\)-coloring
MaRDI profile type: Publication
cites work: Scheduling jobs with fixed start and end times
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: A linear-time algorithm for a special case of disjoint set union
cites work: Q4198056
cites work: Q3328583
cites work: Efficiency of a Good But Not Linear Set Union Algorithm
cites work: Q3707420
cites work: The maximum k-colorable subgraph problem for chordal graphs
full work available at URL: 0166-218x(93)e0174-w
OpenAlex ID: W2138081211
description: scientific article; zbMATH DE number 769294