Perfect stables in graphs

DOI10.1016/0020-0190(83)90091-1MaRDI QIDQ1838296zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(2)

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

This page was built for publication: Perfect stables in graphs

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