Maximal K-Independent Sets in Graphs

Discussiones Mathematicae - Graph Theory - Poland
doi 10.7151/dmgt.1398
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Gora

Related search

Edge-Maximal Graphs of Branchwidth K

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2005English

On Dominating Sets and Independent Sets of Graphs

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
1999English

Using Maximal Independent Sets to Solve Problems in Parallel

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1995English

Resolution Complexity of Independent Sets in Random Graphs

English

Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs

2020English

An Optimal Maximal Independent Set Algorithm for Bounded-Independence Graphs

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2010English

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

BRICS Report Series
2002English

Triangle-Free Geometric Intersection Graphs With No Large Independent Sets

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2014English

Concerning Maximal Sets

Bulletin of the American Mathematical Society
1934English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy