𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A method for the algorithmic description of the cyclical structure of a graph

✍ Scribed by G.F. Stepanets; G.E. Vleduts

Publisher
Elsevier Science
Year
1963
Weight
335 KB
Volume
3
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A recognition algorithm for the total gr
A recognition algorithm for the total graphs
✍ F. Gavril πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 581 KB

## Abstract A graph H is called total if there exists a graph G such that there is a one‐to‐one correspondence between the vertices of H and the vertices and edges of G such that two vertices of H are adjacent iff the corresponding elements of G are adjacent or incident. In this paper we present a

The A4-structure of a graph
The A4-structure of a graph
✍ Michael D. Barrus; Douglas B. West πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 215 KB