Chromatic Number in Time O(2.4023^n) Using Maximal Independent Sets

BRICS Report Series
doi 10.7146/brics.v9i45.21760
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Aarhus University Library

Related search

Using Maximal Independent Sets to Solve Problems in Parallel

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1995English

Maximal K-Independent Sets in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

Comparison of Roman Domination Number With Domination Number, Independent Domination Number and Chromatic Number of a Graph

International Journal for Research in Applied Science and Engineering Technology
2019English

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

SIAM Journal on Computing
MathematicsComputer Science
1993English

Concerning Maximal Sets

Bulletin of the American Mathematical Society
1934English

The Number of Independent Sets in a Connected Graph and Its Complement

The Art of Discrete and Applied Mathematics
2018English

Maximal Metrically Regular Sets

Siberian Electronic Mathematical Reports
Mathematics
2018English

Minimal Closed Sets and Maximal Closed Sets

International Journal of Mathematics and Mathematical Sciences
Mathematics
2006English

Chromatic Number, Independence Ratio, and Crossing Number

Ars Mathematica Contemporanea
AlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTheoretical Computer ScienceTopology
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy