𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Critical theories of some classes of graphs and unary algebras

✍ Scribed by S. V. Sizyi


Publisher
Springer US
Year
1989
Tongue
English
Weight
462 KB
Volume
28
Category
Article
ISSN
0002-5232

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Some classes of perfectly orderable grap
✍ 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

Cyclic gossiping times for some classes
✍ Knisely, James A.; Laskar, Renu πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 574 KB

Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person in the network knows a unique item of information and needs to communicate it to everyone else. In broadcasting, one individu

On a class of kernel-perfect and kernel-
✍ Kiran B. Chilakamarri; Peter Hamburger πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 275 KB

Chilakamarri, K.B. and P. Hamburger, On a class of kernel-perfect and kernel-perfect-critical graphs, Discrete Mathematics 118 (1993) 253-257. In this note we present a construction of a class of graphs in which each of the graphs is either kernel-perfect or kernel-perfect-critical. These graphs or

Minimal graphs of a torus, a projective
✍ Alexander V. Ivashchenko; Yeong-Nan Yeh πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 397 KB

## Contractible transformations of graphs consist of contractible gluing and deleting of vertices and edges of graphs. They partition all graphs into the family of homotopy classes. Contractible transformations do not change the Euler characteristic and the homology groups of graphs. In this paper