✦ LIBER ✦

On perfectness of sums of graphs

✍ Scribed by D. de Werra; A. Hertz

Book ID: 108316281
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 438 KB
Volume: 195
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00168-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Direct Sum of Distributive Lattices on t

Direct Sum of Distributive Lattices on the Perfect Matchings of a Plane Bipartite Graph

✍ Heping Zhang 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 405 KB

A note on strong perfectness of graphs

✍ M. Preissmann; D. de Werra 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 263 KB

Clique-perfectness of complements of lin

Clique-perfectness of complements of line graphs

✍ Flavia Bonomo; Guillermo Durán; Martín D. Safe; Annegret K. Wagler 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 192 KB

On bandwidth sums of graphs

✍ Bing Yao; Jianfang Wang 📂 Article 📅 1995 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 395 KB

Colour Number, Capacity, and Perfectness

Colour Number, Capacity, and Perfectness of Directed Graphs

✍ Emanuela Fachini; János Körner 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 92 KB

Strong perfectness of the generalized Ca

Strong perfectness of the generalized Cartesian product of graphs

✍ Maria Kwaśnik; Alina Szelecka 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 367 KB

In this paper we give a necessary and sufficient condition for the generalized Cartesian product to be strongly perfect. The special case of the result is the known theorem concerning the Cartesian product of two graphs.