✦ LIBER ✦

Adjacent coding of vertices of a graph

✍ Scribed by V. V. Yaremenko

Book ID: 105057784
Publisher: Springer US
Year: 1976
Tongue: English
Weight: 415 KB
Volume: 11
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01069941

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An unexpected result in coding the verti

An unexpected result in coding the vertices of a graph

✍ Melvin A Breuer; Jon Folkman 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 736 KB

Cycles through specified vertices of a g

Cycles through specified vertices of a graph

✍ J. A. Bondy; L. Lovász 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 869 KB

Transformation of a graph into a biparti

Transformation of a graph into a bipartite graph by splitting vertices

✍ O. F. Cherepov 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 185 KB

Covering the cliques of a graph with ver

Covering the cliques of a graph with vertices

✍ Paul Erdős; Tibor Gallai; Zsolt Tuza 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 681 KB

The following problem is investigated. Given an undirected graph G, determine the smallest cardinality of a vertex set that meets all complete subgraphs KC G maximal under inclusion.

Vertices of given degree in a random gra

Vertices of given degree in a random graph

✍ Béla Bollobás 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 349 KB 👁 1 views

How to personalize the vertices of a gra

How to personalize the vertices of a graph?

✍ Kalinowski, Rafał; Pilśniak, Monika; Przybyło, Jakub; Woźniak, Mariusz 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 372 KB