On the recognition of k-equistable graphs

DOI10.1007/978-3-642-34611-8_29MaRDI QIDQ5200515zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

equistable graphmaximal stable setpolynomial time algorithm

Mathematics Subject Classification ID

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

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

Cited in

(12)

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

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)