𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for fraternal orientation of graphs

✍ Scribed by J. Urrutia; F. Gavril

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
339 KB
Volume
41
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Orientation Theorem for Graphs
An Orientation Theorem for Graphs
✍ A.M.H. Gerards πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 519 KB
An algorithm for drawing planar graphs
An algorithm for drawing planar graphs
✍ Bor Plestenjak πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 382 KB πŸ‘ 2 views

A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical s

An algorithm for finding factorizations
An algorithm for finding factorizations of complete graphs
✍ A. J. W. Hilton; Matthew Johnson πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 58 KB πŸ‘ 1 views

## Abstract We show how to find a decomposition of the edge set of the complete graph into regular factors where the degree and edge‐connectivity of each factor is prescribed. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 43: 132–136, 2003