✦ LIBER ✦

Genus distributions for two classes of graphs

✍ Scribed by Merrick L Furst; Jonathan L Gross; Richard Statman

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 663 KB
Volume: 46
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(89)90004-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subdivision thresholds for two classes o

Subdivision thresholds for two classes of graphs

✍ C.A. Barefoot; L.H. Clark; A.J. Depew; R.C. Entringer; L.A. Székely 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 902 KB

The subdivision threshold for a graph F is the maximum number of edges, ex(n; FS), a graph of order n can have without containing a subdivision of F as a subgraph. We consider two instances: (i) F is the graph formed by a cycle C one vertex of which is adjacent to k vertices not on C, and (ii) F is

Two classes of chromatically unique grap

Two classes of chromatically unique graphs

✍ K.M. Koh; B.H. Goh 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 563 KB

## Let P(G; A) denote the chromatic polynomial of a graph G. G is chromatically unique if G is isomorphic to H for any graph H with P(H; A) = P(G; A). In this paper, we provide two new classes of chromatically unique graphs.

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 genus of the Cartesian product of tw

The genus of the Cartesian product of two graphs

✍ Arthur T White 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 248 KB

A separator theorem for graphs of bounde

A separator theorem for graphs of bounded genus

✍ John R Gilbert; Joan P Hutchinson; Robert Endre Tarjan 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 899 KB

Orderly algorithms for generating restri

Orderly algorithms for generating restricted classes of graphs

✍ Charles J. Colbourn; Ronald C. Read 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 463 KB

## Abstract Orderly algorithms for the generation of exhaustive lists of nonisomorphic graphs are discussed. The existence of orderly methods to generate the graphs with a given subgraph and without a given subgraph is established. This method can be used to list all the nonisomorphic subgraphs of