Enumeration and maximum number of maximal irredundant sets for chordal graphs

DOI10.1007/978-3-319-68705-6_22zbMath1483.05180OpenAlexW2765701740MaRDI QIDQ5915797

Dieter Kratsch, Mohamed Yosri Sayadi, Petr A. Golovach, Mathieu Liedloff

Publication date: 4 January 2018

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-68705-6_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Enumeration of maximal irredundant sets for claw-free graphs