Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs

doi 10.1137/1.9781611975994.87
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Maximal K-Independent Sets in Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

On Dominating Sets and Independent Sets of Graphs

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
1999English

Resolution Complexity of Independent Sets in Random Graphs

English

Efficient Independent Set Approximation in Unit Disk Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2018English

Induced Matchings in Subcubic Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Interval Incidence Coloring of Subcubic Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2017English

Planar Lombardi Drawings for Subcubic Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Hereditary Equality of Domination and Exponential Domination in Subcubic Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2019English

Triangle-Free Geometric Intersection Graphs With No Large Independent Sets

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy