✦ LIBER ✦

Minimum spanners of butterfly graphs

✍ Scribed by Shien-Ching Hwang; Gen-Huey Chen

Publisher: John Wiley and Sons
Year: 2001
Tongue: English
Weight: 251 KB
Volume: 37
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum cycle covers of graphs

✍ Fan, Genghua 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 1 views

Some new results on minimum cycle covers are proved. As a consequence, it is obtained that the edges of a bridgeless graph G can be covered by cycles of total length at most |E(G)| + 25 24 (|V (G)| -1), and at most |E(G)| + |V (G)| -1 if G contains no circuit of length 8 or 12.

Minimum cycle bases of Halin graphs

✍ Peter F. Stadler 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

## Abstract Halin graphs are planar 3‐connected graphs that consist of a tree and a cycle connecting the end vertices of the tree. It is shown that all Halin graphs that are not “necklaces” have a unique minimum cycle basis. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 150–155, 2003

Minimum Color Sum of Bipartite Graphs

✍ Amotz Bar-Noy; Guy Kortsarz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 242 KB

The problem of minimum color sum of a graph is to color the vertices of the Ž . graph such that the sum average of all assigned colors is minimum. Recently it was shown that in general graphs this problem cannot be approximated within 1y ⑀ Ž n , for any ⑀ ) 0, unless NP s ZPP Bar-Noy et al., Informa

The minimum degree of Ramsey-minimal gra

The minimum degree of Ramsey-minimal graphs

✍ Jacob Fox; Kathy Lin 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract We write __H__ → __G__ if every 2‐coloring of the edges of graph __H__ contains a monochromatic copy of graph __G__. A graph __H__ is __G__‐__minimal__ if __H__ → __G__, but for every proper subgraph __H__′ of __H__, __H__′ ↛ __G__. We define __s__(__G__) to be the minimum __s__ such th

Minimum path decompositions of oriented

Minimum path decompositions of oriented cubic graphs

✍ K. B. Reid; Keith Wayland 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB 👁 1 views

Pullman [3] conjectured that if k is an odd positive integer, then every orientation of a regular graph of degree k has a minimum decomposition which contains no vertex which is both the initial vertex of some path in the decomposition and the terminal vertex of some other path in the decomposition

Subdivisions of graphs with large minimu

Subdivisions of graphs with large minimum degree

✍ Carsten Thomassen 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB 👁 1 views