✦ LIBER ✦

How to personalize the vertices of a graph?

✍ Scribed by Kalinowski, Rafał; Pilśniak, Monika; Przybyło, Jakub; Woźniak, Mariusz

Book ID: 122210735
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 372 KB
Volume: 40
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2014.02.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New methods to color the vertices of a g

New methods to color the vertices of a graph

✍ Brélaz, Daniel 📂 Article 📅 1979 🏛 Association for Computing Machinery 🌐 English ⚖ 462 KB

Vertices Belonging to All Critical Sets

Vertices Belonging to All Critical Sets of a Graph

✍ Levit, Vadim E.; Mandrescu, Eugen 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 135 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.

Adjacent coding of vertices of a graph

✍ V. V. Yaremenko 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 415 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

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