×

A class of perfect graphs. (English) Zbl 0506.05049


MSC:

05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15 Coloring of graphs and hypergraphs
05B50 Polyominoes
05B40 Combinatorial aspects of packing and covering
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Berge, C.; Chen, C. C.; Chvátal, V.; Seow, C. S., Combinatorial properties of polyominoes, Combinatorica, 1, 217, (1981) · Zbl 0491.05048
[2] Chvátal, V.; Graham, R. L.; Perold, A. F.; Whitesides, S. H., Combinatorial designs related to the strong perfect graph conjecture, Discrete Math., 26, 83, (1979) · Zbl 0403.05017
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.