Recognizing k-equistable Graphs in FPT Time

DOI10.1007/978-3-662-53174-7_34zbMath1417.05217arXiv1503.01098OpenAlexW1656105621MaRDI QIDQ2827831

No author found.

Publication date: 21 October 2016

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

Full work available at URL: https://arxiv.org/abs/1503.01098

zbMATH Keywords

fixed parameter tractabilityrecognition algorithmequistable graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (1)

Strong cliques and equistability of EPT graphs

Cites Work

• Unnamed Item
• Fundamentals of parameterized complexity
• Complexity results for equistable graphs and related classes
• A class of threshold and domishold graphs: Equistable and equidominating graphs
• Modular decomposition and transitive orientation
• Equistable series-parallel graphs
• Equistable chordal graphs
• Threshold graphs and related topics
• Equistable graphs, general partition graphs, triangle graphs, and graph products
• A characterization and hereditary properties for partition graphs
• Equistable simplicial, very well-covered, and line graphs
• Equistable distance-hereditary graphs
• Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• Equistable graphs
• On the Recognition of k-Equistable Graphs
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Recognizing k-equistable Graphs in FPT Time