𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Quasi-parity and perfect graphs

✍ Scribed by Irena Rusu

Book ID
107766210
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
414 KB
Volume
54
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Recognizing Planar Strict Quasi-Parity G
Recognizing Planar Strict Quasi-Parity Graphs
✍ ClΓ‘udia Linhares Sales; FrΓ©dΓ©ric Maffray; Bruce Reed πŸ“‚ Article πŸ“… 2001 πŸ› Springer Japan 🌐 English βš– 157 KB
Perfectly orderable graphs are quasi-par
Perfectly orderable graphs are quasi-parity graphs: a short proof
✍ A. Hertz; D. de Werra πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 287 KB

%'c shw that perfectly orderabk grapk Sa are q&-parity graphs by exhibiting two &lodes which are not llinked by a chordless odd chain. This proof is short and simpler than the one given by H. Meynid.

Special parity of perfect matchings in b
Special parity of perfect matchings in bipartite graphs
✍ Ron Aharoni; Rachel Manber; Bronislaw Wajnryb πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 527 KB

Let G be a bipartite graph in which every edge belongs to some perfect matching, and let D be a subset of its edge set. It is shown that M fl D has the same parity for every perfect matching M if and only if D is a cut, and equivalently if and only. if (G, D) is a balanced signed-graph. This gives n