Discussiones Mathematicae Graph Theory > 2001 > 21 > 2 > 293-301
Source
Abstract
Identifiers
journal ISSN : | 2083-5892 |
DOI | 10.7151/dmgt.1151 |
Authors
Keywords
Additional information
Publisher
Fields of science
Bibliography
-
[1] V.E. Alekseev, A polynomial algorithm for finding maximum stable sets in fork-free graphs, Discrete Analysis and Operations Research, Ser.1, 6 (4) (1999) 3-19 (in Russian).
-
[2] A. Brandstädt, The jump number problem for biconvex graphs and rectangle covers of rectangular regions, Lecture Notes in Computer Science 380 (1989) 68-77, doi: 10.1007/3-540-51498-8₇.
-
[3] K. Cameron, Induced matchings, Discrete Appl. Math. 24 (1989) 97-102, doi: 10.1016/0166-218X(92)90275-F.