𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast generation of some classes of planar graphs

✍ Scribed by G. Brinkmann; B.D. McKay

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
58 KB
Volume
3
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Generalizations of planar graphs
Generalizations of planar graphs
✍ Ranel E. Erickson πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 677 KB
Fast generation of cubic graphs
Fast generation of cubic graphs
✍ Brinkmann, Gunnar πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 620 KB

In this paper an efficient algorithm to generate regular graphs with small vertex valency is presented. The running times of a program based on this algorithm and designed to generate cubic graphs are below two natural benchmarks: (a) If N ( n ) denotes the number of pairwise non-isomorphic cubic gr

Some classes of perfectly orderable grap
Some classes of perfectly orderable graphs
✍ C. T. HoΓ ng; B. A. Reed πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 815 KB

In 1981, Chvatal defined the class of perfectly orderable graphs. This class of perfect graphs contains the comparability graphs and the triangulated graphs. In this paper, we introduce four classes of perfectly orderable graphs, including natural generalizations of the comparability and triangulate