𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on perfect graphs

✍ Scribed by K. Cameron; J. Edmonds; L. Lovász

Book ID
105327386
Publisher
Springer Netherlands
Year
1986
Tongue
English
Weight
164 KB
Volume
17
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on path-perfect graphs
A note on path-perfect graphs
✍ John Frederick Fink; H.Joseph Straight 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 498 KB

In this paper we explore the c:oncept of factoring a graph into non-isomorphic paths. Lel Pi denote the path of length i. We SAY that a graph G having $n(n + 1) edges is path-perfect if E( G) can be partitioned as E, UE, !J l \* l U & such that the subgraph of G induced by 32i is isomorphic to Pr, f

A note on Ki-perfect graphs
A note on Ki-perfect graphs
✍ Jason I. Brown; Derek G. Corneil; A. Ridha Mahjoub 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 348 KB

## Abstract __Ki__‐perfect graphs are a special instance of __F ‐ G__ perfect graphs, where __F__ and __G__ are fixed graphs with __F__ a partial subgraph of __G.__ Given __S__, a collection of __G__‐subgraphs of graph __K__, an __F ‐ G__ cover of __S__ is a set of __T__ of __F__‐subgraphs of __K__

A note on the characterization of domina
A note on the characterization of domination perfect graphs
✍ Jason Fulman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract A graph __G__ is domination perfect if for each induced subgraph __H__ of __G__, γ(__H__) = __i__(__H__), where γ and __i__ are a graph's domination number and independent domination number, respectively. Zverovich and Zverovich [3] offered a finite forbidden induced characterization of

A note on the number of perfect matching
A note on the number of perfect matchings of bipartite graphs
✍ Zhang Fuji; Zhang Heping 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 484 KB

Let G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perfect matchings. For plane bipartite graphs each interior face of which is surrounded by a circuit of length 4s + 2, s E { 1,2,. . .}, an elegant formula, i.e. det A = (-1 )nK2, had been rigorously proved by Cv