On the independence number of minimum distance graphs
type: Item
instance of: scholarly article
title: On the independence number of minimum distance graphs
zbMATH Open document ID: 0912.68149
DOI: 10.1007/PL00009381
published in: Discrete \& Computational Geometry
publication date: 1999-05-18T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1239606
zbMATH Keywords: minimum distance graph
author: György Csizmadia
MaRDI profile type: Publication
cites work: Q3027796
cites work: Q4339095
cites work: Q4885186
cites work: Increasing the minimum distance of a set of points
Recommended article: On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators
Recommended article: On the independent domination number of graphs with given minimum degree
Recommended article: On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\)
Recommended article: On minimum maximal independent sets of a graph
Recommended article: Q3688417
Recommended article: On the independence ratio of distance graphs
Recommended article: On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
Recommended article: On Independent Sets in Graphs with Given Minimum Degree
Recommended article: Q6061499
Recommended article: The minimum spectral radius of graphs with a given independence number
description: scientific article; zbMATH DE number 1239606