✦ LIBER ✦

Characterizations of -copwin graphs

✍ Scribed by Nancy E. Clarke; Gary MacGillivray

Book ID: 113567567
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 197 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.01.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterizations of outerplanar graphs

✍ Maciej M. Sysło 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 750 KB 👁 1 views

The paper presents several characterizations of outerp:anar graphs, some of them are counterparts of the well-known characterizations of planar graphs and the other provide very efficient tools for outerplanarity testing, coding (i.e. isomorphism testing), and counting such graphs. Finally, we attem

Characterizations of signed graphs

✍ Thomas Zaslavsky 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 271 KB

## Abstract The possible classes of balanced circles of a signed graph are characterized in two ways.

Partial characterizations of circle grap

Partial characterizations of circle graphs

✍ Flavia Bonomo; Guillermo Durán; Luciano N. Grippo; Martín D. Safe 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 324 KB

Characterizations of regular magic graph

Characterizations of regular magic graphs

✍ Michael Doob 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 575 KB

Spectral characterizations of sandglass

Spectral characterizations of sandglass graphs

✍ Pengli Lu; Xiaogang Liu; Zhanting Yuan; Xuerong Yong 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 633 KB

The sandglass graph is obtained by appending a triangle to each pendant vertex of a path. It is proved that sandglass graphs are determined by their adjacency spectra as well as their Laplacian spectra.

Characterizations of bipartite Steinhaus

Characterizations of bipartite Steinhaus graphs

✍ Gerard J. Chang; Bhaskar DasGupta; Wayne M. Dymàček; Martin Fürer; Matthew Koerl 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 821 KB

We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion had previously been given for the number of bipartite Steinhaus graphs and we give two fascinating closed forms for this