✦ LIBER ✦

The maximum genus of graphs with diameter three

✍ Scribed by Yuanqiu Huang; Yanpei Liu

Book ID: 108316246
Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 544 KB
Volume: 194
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00037-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximum genus of graphs of diameter

The maximum genus of graphs of diameter two

✍ Martin Škoviera 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Skoviera, M., The maximum genus of graphs of diameter two, Discrete Mathematics 87 (1991) 175-180. Let G be a (finite) graph of diameter two. We prove that if G is loopless then it is upper embeddable, i.e. the maximum genus y,&G) equals [fi(G)/Z], where /3(G) = IF(G)1 -IV(G)1 + 1 is the Betti numbe

The Maximum Genus of a Graph with Given

The Maximum Genus of a Graph with Given Diameter and Connectivity

✍ Humg-Lin Fu; Ming-Chun Tsai 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 299 KB

The Maximum Genus of a Graph with Given

The Maximum Genus of a Graph with Given Diameter and Connectivity

✍ Hung-Lin Fu; Ming-Chun Tsai 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Maximum pebbling number of graphs of dia

Maximum pebbling number of graphs of diameter three

✍ Boris Bukh 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 93 KB 👁 1 views

## Abstract Given a configuration of pebbles on the vertices of a graph __G__, a __pebbling move__ consists of taking two pebbles off some vertex __v__ and putting one of them back on a vertex adjacent to __v__. A graph is called __pebbleable__ if for each vertex __v__ there is a sequence of pebbli

Maximum genus of regular graphs

✍ M. Kotrbčík 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 181 KB

The maximum interval number of graphs wi

The maximum interval number of graphs with given genus

✍ Edward R. Scheinerman 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB 👁 1 views

The interval number of a graph G, denoted i(G), is the least positive integer t such that G is the intersection graph of sets, each of which is the union of t compact real intervals. It is known that every planar graph has interval number at most 3 and that this result is best possible. We investiga