Penta-extensions of hereditary classes of graphs

DOI10.1007/S10878-005-2271-0zbMATH Open1080.05094OpenAlexW2073160305MaRDI QIDQ813334FDOQ813334

Authors: Inessa I. Zverovich, I.È. Zverovich 

Publication date: 8 February 2006

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-005-2271-0

Recommendations

• Stability number in subclasses of \(P_5\)-free graphs
• scientific article; zbMATH DE number 1833095
• Some results on maximum stable sets in certain \(P_{5}\)-free graphs
• Stabex method for extension of \(\alpha\)-polynomial hereditary classes.
• Stable sets in \(k\)-colorable \(P_{5}\)-free graphs

zbMATH Keywords

polynomial-time algorithmstability numberMahadev graphspentagraph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Title not available (Why is that?)
• Extension of hereditary classes with substitutions
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• On rigid circuit graphs
• On maximal independent sets of vertices in claw-free graphs
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Polynomial algorithm for finding the largest independent sets in graphs without forks
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• On the structure of pentagraphs
• Stability number in subclasses of \(P_5\)-free graphs

This page was built for publication: Penta-extensions of hereditary classes of graphs

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