On maximum number of minimal dominating sets in graphs

DOI10.1016/j.endm.2005.06.028zbMath1200.05158OpenAlexW2024665635WikidataQ60488768 ScholiaQ60488768MaRDI QIDQ3439327

Fedor V. Fomin, Fabrizio Grandoni, Alexey A. Stepanov, Artem V. Pyatkin

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.028

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Unnamed Item

Cites Work

• A note on the complexity of the chromatic number problem
• On cliques in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On maximum number of minimal dominating sets in graphs