✦ LIBER ✦

Cyclomatic numbers of planar graphs

✍ Scribed by Klara J. Cohn

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 283 KB
Volume: 178
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)81833-x

No coin nor oath required. For personal study only.

✦ Synopsis

For a given planar graph G with a set A of independent vertices, we provide a best-possible upper bound for the minimum cyclomatic number of connected induced subgraphs of G containing A. The extremal graphs are also characterized. @

📜 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

Domination numbers of planar graphs

✍ MacGillivray, G.; Seyffarth, K. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 967 KB

The problem of determining the domination number of a graph is a well known NPhard problem, even when restricted to planar graphs. By adding a further restriction on the diameter of the graph, we prove that planar graphs with diameter two and three have bounded domination numbers. This implies that

Cyclomatic numbers of connected induced

Cyclomatic numbers of connected induced subgraphs

✍ Xingxing Yu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 509 KB

We give an upper bound for w(A), the minimum cyclomatic number of connected induced subgraphs containing a given independent set A of vertices in a given graph G. We also give an upper bound for w(A) when G is triangle-free. We show that these two bounds are best possible. Similar results are obtai

Independence Numbers of Planar Contact G

Independence Numbers of Planar Contact Graphs

✍ Swanepoel 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 232 KB

Star chromatic numbers of some planar gr

Star chromatic numbers of some planar graphs

✍ Gao, Guogang; Wang, Yiju; Zhou, Huishan 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB 👁 2 views

The concept of the star chromatic number of a graph was introduced by Vince (A. Vince, Star chromatic number, J. Graph Theory 12 (1988), 551--559), which is a natural generalization of the chromatic number of a graph. This paper calculates the star chromatic numbers of three infinite families of pla

On the cyclomatic number of a hypergraph

✍ B.D. Acharya 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 572 KB

## This note generalizes the notion of cyclomatic number (or cycle rank) from Graph Theory to Hypergraph Theory and links it up with the concept of planarity in hypergraphs which was recently introducea by R.P. Jones. Sharp bounds are obtained for the cyclomatic number of the planar hypergraphs an