On the number of maximal independent sets in minimum colorings of split graphs
type: Item
instance of: scholarly article
title: On the number of maximal independent sets in minimum colorings of split graphs
zbMATH Open document ID: 1394.05057
author: Boštjan Brešar
author: Nazanin Movarraei
published in: Discrete Applied Mathematics
publication date: 2018-09-06T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6933527
zbMATH Keywords: dominating-\(\chi\)-coloring
zbMATH Keywords: coloring
zbMATH Keywords: domination
zbMATH Keywords: split graph
zbMATH Keywords: maximal independent set
MaRDI profile type: Publication
full work available at URL: j.dam.2018.03.083
OpenAlex ID: W2796857883
cites work: Pebbling in Split Graphs
cites work: Maximal independent sets in minimum colorings
cites work: Q3615811
cites work: Bounding the clique-width of \(H\)-free split graphs
cites work: Computing role assignments of split graphs
cites work: Q4504904
cites work: Q4198056
cites work: On idomatic partitions of direct products of complete graphs
cites work: Fall colouring of bipartite graphs and Cartesian products of graphs
cites work: Q3378230
cites work: Topics in Intersection Graph Theory
cites work: Idomatic partitions of direct products of complete graphs
DOI: 10.1016/J.DAM.2018.03.083
description: scientific article; zbMATH DE number 6933527