×
Deming, Robert W.

Independence numbers of graphs - an extension of the Koenig-Egervary theorem. (English) Zbl 0404.05034

Discrete Math. 27, 23-33 (1979).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0404.05034

Cited in 1 Review
Cited in 53 Documents

MSC:

05C35 Extremal problems in graph theory

Keywords:

Independence Number; Maximum Edge Matching; Algorithm
PDF BibTeX XML Cite
\textit{R. W. Deming}, Discrete Math. 27, 23--33 (1979; Zbl 0404.05034)
Full Text: DOI
  • logo of hbz
  • logo of WorldCat

References:

[1] Edmonds, J., Paths, trees, and flowers, Canad. J. math., 17, 449-467, (1965) · Zbl 0132.20903
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.