Algorithms on clique separable graphs
type: Item
instance of: scholarly article
title: Algorithms on clique separable graphs
zbMATH Open document ID: 0378.05042
DOI: 10.1016/0012-365X(77)90030-9
author: Fanica Gavril
published in: Discrete Mathematics
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C99
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 3588697
MaRDI profile type: Publication
cites work: Q3941433
cites work: On rigid circuit graphs
cites work: Q5341588
cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs
cites work: Triangulated graphs and the elimination process
cites work: Q5554163
full work available at URL: 0012-365x(77)90030-9
OpenAlex ID: W2013949481
description: scientific article; zbMATH DE number 3588697