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

DOI10.1016/J.DAM.2018.03.083zbMATH Open1394.05057OpenAlexW2796857883MaRDI QIDQ1671359FDOQ1671359

Authors: 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

Recommendations

• Maximal independent sets in minimum colorings
• Dominated colorings of graphs
• Dominating coloring number of claw-free graphs
• Algorithmic aspects of dominator colorings in graphs
• Edge-coloring of split graphs.

zbMATH Keywords

split graphdominationmaximal independent setcoloringdominating-\(\chi\)-coloring

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Topics in Intersection Graph Theory
• Independent domination and graph colorings
• Maximal independent sets in minimum colorings
• Computing role assignments of split graphs
• Pebbling in Split Graphs
• Fall colouring of bipartite graphs and Cartesian products of graphs
• Independent domatic partitioning or fall coloring of strongly chordal graphs
• Title not available (Why is that?)
• On idomatic partitions of direct products of complete graphs
• Idomatic partitions of direct products of complete graphs
• Bounding the clique-width of \(H\)-free split graphs

Cited In (4)

• THE DOMINATION GAME ON SPLIT GRAPHS
• Title not available (Why is that?)
• Maximal independent sets in minimum colorings
• Minimum partition of an independence system into independent sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671359)