On the number of maximal independent sets in minimum colorings of split graphs

DOI10.1016/j.dam.2018.03.083zbMath1394.05057OpenAlexW2796857883MaRDI QIDQ1671359

Boštjan Brešar, Nazanin Movarraei

Publication date: 6 September 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.083

zbMATH Keywords

split graphdominationcoloringmaximal independent setdominating-\(\chi\)-coloring

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

THE DOMINATION GAME ON SPLIT GRAPHS

Cites Work

• Computing role assignments of split graphs
• Maximal independent sets in minimum colorings
• On idomatic partitions of direct products of complete graphs
• Idomatic partitions of direct products of complete graphs
• Fall colouring of bipartite graphs and Cartesian products of graphs
• Pebbling in Split Graphs
• Topics in Intersection Graph Theory
• Bounding the clique-width of \(H\)-free split graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of maximal independent sets in minimum colorings of split graphs