✦ LIBER ✦

Graphs defined by coverings of a set

✍ Scribed by R. K. Guy; E. C. Milner

Publisher: Akadmiai Kiad
Year: 1968
Tongue: English
Weight: 703 KB
Volume: 19
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01894676

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Defining extremes and trimming by minimu

Defining extremes and trimming by minimum covering sets

✍ R.A. Maller 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 759 KB

The obstructions of a minor-closed set o

The obstructions of a minor-closed set of graphs defined by a context-free grammar

✍ B Courcelle; G Sénizergues 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 979 KB

We establish that the finite set of obstructions of a minor-closed set of graphs given by a hyperedge replacement grammar can be effectively constructed. Our proof uses an auxiliary result stating that the system of equations associated with a proper hyperedge replacement grammar has a unique soluti

Covering a graph by a set of paths origi

Covering a graph by a set of paths originating at a single vertex

✍ I. S. Grunskii; D. V. Speranskii 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 466 KB

Epiderivatives defined by a set of infin

Epiderivatives defined by a set of infinitesimals

✍ S. S. Kutateladze 📂 Article 📅 1988 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 310 KB

Defining sets and uniqueness in graph co

Defining sets and uniqueness in graph colorings: A survey

✍ E.S. Mahmoodian 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 66 KB

Graph theoretic relaxations of set cover

Graph theoretic relaxations of set covering and set partitioning problems

✍ Elia El-Darzi; Gautam Mitra 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 786 KB