๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Covering the edges with consecutive sets

โœ Scribed by Guoli Ding

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
168 KB
Volume
15
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

โœฆ Synopsis

Abstract

The following question is answered in this note: for which graphs G can the vertices of G be linearly ordered so that all the minimal vertex covers of G are consecutive sets?.

๐Ÿ“œ SIMILAR VOLUMES

Covering a graph with cycles passing thr
Covering a graph with cycles passing through given edges
โœ Wang, Hong ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 91 KB ๐Ÿ‘ 2 views

We propose a conjecture: for each integer k โ‰ฅ 2, there exists N (k) such that if G is a graph of order n โ‰ฅ N (k) and d(x) + d(y) โ‰ฅ n + 2k -2 for each pair of nonadjacent vertices x and y of G, then for any k independent edges e 1 , . . . , e k of G, there exist If this conjecture is true, the condi

Dominating sets with small clique coveri
Dominating sets with small clique covering number
โœ Penrice, Stephen G. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 84 KB ๐Ÿ‘ 2 views

Motivated by earlier work on dominating cliques, we show that if a graph G is connected and contains no induced subgraph isomorphic to P 6 or H t (the graph obtained by subdividing each edge of K 1,t , t โ‰ฅ 3, by exactly one vertex), then G has a dominating set which induces a connected graph with cl

Borsuk covering and planar sets with uni
Borsuk covering and planar sets with unique completion
โœ Krzysztof Koล‚odziejczyk ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 617 KB

The famous problem of Borsuk, whether every bounded set in aB" can be covered by n+ 1 sets of smaller diameter, is still open for n > 4. We give an equivalent formulation of the problem. In the plane, the only sets which cannot be covered by two sets of smaller diameter are those whose completion is