✦ LIBER ✦

Graph covers using t-colourable vertex sets

✍ Scribed by Sylvain Gravier; Jeannette Janssen; Kyriakos Kilakos; Sulamita Klein

Book ID: 108315913
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 310 KB
Volume: 278
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(03)00246-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex Coverings by Coloured Induced Gra

Vertex Coverings by Coloured Induced Graphs—Frames and Umbrellas

✍ Wayne Goddard; Michael A. Henning 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 477 KB

Vertex coverings by coloured induced gra

Vertex coverings by coloured induced graphs — Frames and Umbrellas

✍ Goddard, Wayne; Henning, Michael A. 📂 Article 📅 2005 🏛 Taylor and Francis Group 🌐 English ⚖ 185 KB

The Resolution Complexity of Independent

The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs

✍ Paul Beame; Russell Impagliazzo; Ashish Sabharwal 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 486 KB

d-Transversals of stable sets and vertex

d-Transversals of stable sets and vertex covers in weighted bipartite graphs

✍ Bentz, C.; Costa, M.-C.; Picouleau, C.; Ries, B.; de Werra, D. 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 200 KB

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

A characterization of uniquely vertex co

A characterization of uniquely vertex colorable graphs using minimal defining sets

✍ H. Hajiabolhassan; M.L. Mehrabadi; R. Tusserkani; M. Zaker 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 267 KB

A defining set (sf cute-x coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We define a minimal d&kg set to be a defining set which does not properly contain another defining set. If G is a uniquely ver