𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Classic Papers in Combinatorics || A Characterization of Perfect Graphs

✍ Scribed by Gessel, Ira; Rota, Gian-Carlo

Book ID
118168054
Publisher
Birkhäuser Boston
Year
2009
Weight
671 KB
Category
Article
ISBN
0817648429

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A characterization of domination perfect
A characterization of domination perfect graphs
✍ I. E. Zverovich; V. E. Zverovich 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

Let u(G) and i(G) be the domination number and independent domination number of a graph G. respectively. Sumner and Moore [8] define a graph G to be domination perfect if y( H) = i( H), for every induced subgraph H of G. In this article, we give a finite forbidden induced subgraph characterization o

A Characterization of b-Perfect Graphs
A Characterization of b-Perfect Graphs
✍ Chính T. Hoàng; Frédéric Maffray; Meriem Mechebbek 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB

## Abstract A b‐coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b‐chromatic number of a graph __G__ is the largest integer __k__ such that __G__ admits a b‐coloring with __k__ colors. A graph is b

Combinatorics of perfect matchings in pl
Combinatorics of perfect matchings in plane bipartite graphs and application to tilings
✍ J.C. Fournier 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 737 KB

Let G be a plane bipartite graph which admits a perfect matching and with distinguished faces called holes. Let MG denote the perfect matchings graph: its vertices are the perfect matchings of G, two of them being joined by an edge, if and only if they di er only on an alternating cycle bounding a f