On the equivalence covering number of splitgraphs
type: Item
instance of: scholarly article
title: On the equivalence covering number of splitgraphs
zbMATH Open document ID: 0875.68456
DOI: 10.1016/0020-0190(95)00037-D
author: Aart Blokhuis
author: Ton Kloks
published in: Information Processing Letters
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 985326
zbMATH Keywords: Algorithms
zbMATH Keywords: Graph algorithms
zbMATH Keywords: Equivalence covering
zbMATH Keywords: Splitgraphs
MaRDI profile type: Publication
cites work: Covering graphs by the minimum number of equivalence relations
cites work: Q3853641
cites work: Q3328583
cites work: The NP-Completeness of Edge-Coloring
cites work: The NP-completeness column: an ongoing guide
cites work: Clique covers and coloring problems of graphs
cites work: Complexity of dimension three and some related edge-covering characteristics of graphs
cites work: Q3035328
cites work: Q3491618
cites work: A Property of Infinite Products of Boolean Matrices
full work available at URL: 0020-0190(95)00037-d
OpenAlex ID: W2115487960
Recommended article: On graphs with equal domination and covering numbers
Recommended article: Q4510677
Recommended article: Graphs with equal domination and covering numbers
Recommended article: Covering graphs by the minimum number of equivalence relations
Recommended article: Characterization of graphs with equal domination and covering number
Recommended article: Q4224343
Recommended article: Equicovering subgraphs of graphs and hypergraphs
Recommended article: The splitting number of complete bipartite graphs
Recommended article: Q4034791
Recommended article: Q4989607
description: scientific article; zbMATH DE number 985326