Perfect stables in graphs

DOI10.1016/0020-0190(83)90091-1zbMath0509.68038OpenAlexW2063450596MaRDI QIDQ1838296

Cornelius Croitoru, Emilian Suditu

Publication date: 1983

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(83)90091-1

zbMATH Keywords

NP-completeperfect matchingperfect stable

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

\(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• On maximal independent sets of vertices in claw-free graphs
• Paths, Trees, and Flowers
• A remark on a problem of Harary

This page was built for publication: Perfect stables in graphs