The Hypocoloring Problem: Complexity and Approximability Results When the Chromatic Number Is Small

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-30559-0_32
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

The Quadratic Shortest Path Problem: Complexity, Approximability, and Solution Methods

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2018English

Critical Chromatic Number and the Complexity of Perfect Packings in Graphs

2006English

Geometric Spanners With Small Chromatic Number

English

Approximability of the Subset Sum Reconfiguration Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

The B-Chromatic Number of Graphs

International Journal of Computer Applications
2013English

The Chromatic Number of Kneser Hypergraphs

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1986English

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal

2020English

Chromatic Number, Independence Ratio, and Crossing Number

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2008English

Correction To: Weighted Upper Edge Cover: Complexity and Approximability

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy