On the Recognition of k-Equistable Graphs

DOI10.1007/978-3-642-34611-8_29zbMath1341.05110OpenAlexW2183714943MaRDI QIDQ5200515

Martin Milanič, David Tankus, Vadim E. Levit

Publication date: 6 November 2012

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-642-34611-8_29

zbMATH Keywords

polynomial time algorithmmaximal stable setequistable graph

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Signed and weighted graphs (05C22)

Related Items (4)

Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs ⋮ Linear separation of connected dominating sets in graphs ⋮ Recognizing k-equistable Graphs in FPT Time ⋮ Strong cliques and equistability of EPT graphs

This page was built for publication: On the Recognition of k-Equistable Graphs