Penta-extensions of hereditary classes of graphs
From MaRDI portal
Publication:813334
DOI10.1007/s10878-005-2271-0zbMath1080.05094OpenAlexW2073160305MaRDI QIDQ813334
Inessa I. Zverovich, Igor Edm. 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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rigid circuit graphs
- On maximal independent sets of vertices in claw-free graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Extension of hereditary classes with substitutions
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
This page was built for publication: Penta-extensions of hereditary classes of graphs
