๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Embeddings of graphs

โœ Scribed by Carsten Thomassen

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
861 KB
Volume
124
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Embeddings of bipartite graphs
Embeddings of bipartite graphs
โœ Mohammed Abu-Sbeih; T. D. Parsons ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 458 KB
Embeddings of infinite graphs
Embeddings of infinite graphs
โœ Bojan Mohar ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 919 KB
Quadrilateral embeddings of bipartite gr
Quadrilateral embeddings of bipartite graphs
โœ Ian Anderson ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 304 KB

## Abstract Current graphs and a theorem of White are used to show the existence of almost complete regular bipartite graphs with quadrilateral embeddings conjectured by Pisanski. Decompositions of __K~n~__ and __K~n, n~__ into graphs with quadrilateral embeddings are discussed, and some thickness

Induced embeddings in Steinhaus graphs
Induced embeddings in Steinhaus graphs
โœ Delahan, Franz A. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 256 KB ๐Ÿ‘ 2 views

Fix any positive integer n. Let S be the set of all Steinhaus graphs of order n(n -1)/2 + 1. The vertices for each graph in S are the first n(n -1)/2 + 1 positive integers. Let I be the set of all labeled graphs of order n with vertices of the form i(i -1)/2 + 1 for the first n positive integers i.