Maximum internally stable sets of a graph

DOI10.1016/0022-247X(69)90233-9zbMath0167.52105OpenAlexW1977702389MaRDI QIDQ2530476

Yanyan Li

Publication date: 1969

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(69)90233-9

zbMATH Keywords

topology

Related Items

Determining the number of internal stability of a graph ⋮ Clique detection for nondirected graphs: Two new algorithms ⋮ Minimum decomposition of partially ordered sets into chains ⋮ A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically ⋮ Covers, matchings and odd cycles of a graph ⋮ Graph theory ⋮ The maximum clique problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Algorithm for a Minimum Cover of a Graph
• Covers and packings in a family of sets
• Optimal matchings and degree-constrained subgraphs
• Paths, Trees, and Flowers
• Modification of Edmonds' maximum matching algorithm
• Discrete Optimizing