✦ LIBER ✦

Covering Planar Graphs with a Fixed Number of Balls

✍ Scribed by Victor Chepoi; Bertrand Estellon; Yann Vaxes

Publisher: Springer
Year: 2007
Tongue: English
Weight: 180 KB
Volume: 37
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-006-1260-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Semiharmonic graphs with fixed cyclomati

Semiharmonic graphs with fixed cyclomatic number

✍ A Dress; S Grünewald; D Stevanović 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 394 KB

Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c \_> 2, there are at most finitely many trunks of serniharrnonic graphs with cyclomatic number e--in contrast to the fact established by the last two of the present authors in their paper

On graphs with a fixed number of negativ

On graphs with a fixed number of negative eigenvalues

✍ Aleksander Torgašev 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 374 KB

Let P(n) be the class of all connected graphs having exactly n ~> 1 negative eigenvalues (including their multiplicities). In this paper we prove that the class P(n) contains only finitely many so-called canonical graphs. The analogous statement for the class Q(n) of all connected graphs having exac

Characterization of graphs with equal do

Characterization of graphs with equal domination and covering number

✍ Bert Randerath; Lutz Volkmann 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 592 KB

Let G be a simple graph of order n(G). A vertex set D of G is dominating if every vertex not in D is adjacent to some vertex in D, and D is a covering if every edge of G has at least one end in D. The domination number 7(G) is the minimum order of a dominating set, and the covering number/~(G) is th

A class of planar well-covered graphs wi

A class of planar well-covered graphs with girth four

✍ Michael R. Pinter 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 616 KB

## Abstract A well‐covered graph is a graph in which every maximal independent set is a maximum independent set; Plummer introduced the concept in a 1970 paper. The notion of a 1‐well‐covered graph was introduced by Staples in her 1975 dissertation: a well‐covered graph __G__ is 1‐well‐covered if a

The chromatic covering number of a graph

✍ Reza Naserasr; Claude Tardif 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

Following [1] , we investigate the problem of covering a graph G with induced subgraphs G 1 ; . . . ; G k of possibly smaller chromatic number, but such that for every vertex u of G, the sum of reciprocals of the chromatic numbers of the G i 's containing u is at least 1. The existence of such ''ch

A Graph with cover degeneracy less than

A Graph with cover degeneracy less than chromatic number

✍ A.V. Pyatkin 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 78 KB 👁 1 views

## Abstract This note contains an example of a 4‐chromatic graph which admits a vertex partition into three parts such that the union of every two of them induces a forest. © 2001 John Wiley & Sons, Inc. J Graph Theory 37: 243–246, 2001