Completely separable graphs
type: Item
instance of: scholarly article
title: Completely separable graphs
zbMATH Open document ID: 0694.05060
DOI: 10.1016/0166-218X(90)90131-U
author: Peter L. Hammer
author: Frédéric Maffray
published in: Discrete Applied Mathematics
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 4136000
zbMATH Keywords: Boolean functions
zbMATH Keywords: separability
zbMATH Keywords: Completely separable graphs
zbMATH Keywords: liner time algorithms
zbMATH Keywords: recognition
zbMATH Keywords: optimization problems
zbMATH Keywords: maximum weighted stable set
zbMATH Keywords: maximum eighted clique
MaRDI profile type: Publication
cites work: Distance-hereditary graphs
cites work: Topics on perfect graphs
cites work: Parity Graphs
cites work: Which claw-free graphs are perfectly orderable?
cites work: Q4165164
cites work: A Linear Recognition Algorithm for Cographs
cites work: A Combinatorial Decomposition Theory
cites work: Recognizing circle graphs in polynomial time
cites work: On brittle graphs
cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
cites work: Q5596090
cites work: On a property of the class of n-colorable graphs
Wikidata QID: Q127976387
description: scientific article; zbMATH DE number 4136000