𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On rank-perfect subclasses of near-bipartite graphs

✍ Scribed by Annegret K. Wagler

Book ID
106308154
Publisher
Springer
Year
2005
Tongue
English
Weight
93 KB
Volume
3
Category
Article
ISSN
1619-4500

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Z-transformation graphs of perfect match
Z-transformation graphs of perfect matchings of plane bipartite graphs
✍ Heping Zhang; Fuji Zhang; Haiyuan Yao πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 343 KB

Let G be a plane bipartite graph with at least two perfect matchings. The Z-transformation graph, ZF (G), of G with respect to a speciΓΏc set F of faces is deΓΏned as a graph on the perfect matchings of G such that two perfect matchings M1 and M2 are adjacent provided M1 and M2 di er only in a cycle t

The rotation graphs of perfect matchings
The rotation graphs of perfect matchings of plane bipartite graphs
✍ Heping Zhang; Fuji Zhang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 517 KB

In the present paper, the minimal proper alternating cycle (MPAC) rotation graph R(G) of perfect matchings of a plane bipartite graph G is defined. We show that an MPAC rotation graph R(G) of G is a directed rooted tree, and thus extend such a result for generalized polyhex graphs to arbitrary plane