On the recognition of k-equistable graphs

DOI10.1007/978-3-642-34611-8_29zbMATH Open1341.05110OpenAlexW2183714943MaRDI QIDQ5200515FDOQ5200515

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

Recommendations

• Recognizing \(k\)-equistable graphs in FPT time
• Equistable distance-hereditary graphs
• Complexity results for equistable graphs and related classes
• Equistable series-parallel graphs
• Equistable graphs

zbMATH Keywords

equistable graphpolynomial time algorithmmaximal stable set

Mathematics Subject Classification ID

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

Cited In (11)

• Strong cliques and equistability of EPT graphs
• Recognition of Graphs with Convex Quadratic Stability Number
• Linear separation of connected dominating sets in graphs
• Complexity results for equistable graphs and related classes
• Title not available (Why is that?)
• Equistable chordal graphs
• Recognizing \(k\)-equistable graphs in FPT time
• Equistable distance-hereditary graphs
• Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
• Efficiently recognizing graphs with equal independence and annihilation numbers
• Recognizing brittle graphs: Remarks on a paper of Hoàng and Khouzam

This page was built for publication: On the recognition of \(k\)-equistable graphs

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