𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An oriented graph connected with an ordered pair of ordered partitions

✍ Scribed by L. M. Koganov

Publisher
SP MAIK Nauka/Interperiodica
Year
1987
Tongue
English
Weight
157 KB
Volume
41
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An upper bound for orders of certain (k,
An upper bound for orders of certain (k, k))-connected graphs
✍ Kiyoshi Ando πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 275 KB

A fragment of a connected graph G is a subset A of V(C) consisting of components of G-S such that V(G)-S-A #0 where S is a minimum cut of G. A graph G is said to be (k, I;)- We prove the following result. Let k and k be integers with 1 <i < k, and let G be a critically (k, k)-connected graph. If no

Cell rotation graphs of strongly connect
Cell rotation graphs of strongly connected orientations of plane graphs with an application
✍ Heping Zhang; Peter Che Bor Lam; Wai Chee Shiu πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 345 KB

The cell rotation graph D(G) on the strongly connected orientations of a 2-edge-connected plane graph G is deΓΏned. It is shown that D(G) is a directed forest and every component is an in-tree with one root; if T is a component of D(G), the reversions of all orientations in T induce a component of D(

Ordering of an epoxy polymer in orientat
Ordering of an epoxy polymer in orientation
✍ V. P. Korkhov; E. A. Faitel'son; Yu. M. Molchanov πŸ“‚ Article πŸ“… 1990 πŸ› Springer US 🌐 English βš– 1020 KB