𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Crossing-critical edges and Kuratowski subgraphs of a graph

✍ Scribed by Jozef S̆irán̆

Book ID
107884184
Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
520 KB
Volume
35
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edges and Kuratowski Subgraphs of Non-Pl
Edges and Kuratowski Subgraphs of Non-Planar Graphs
✍ Jozef Širáň 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB

It is proved that any edge of a Pconnected non-planar graph G of order a t least 6 lies in a subdivision of K3,3 in G. For any 3-connected non-planar graph G of order a t least 6 we show that G contains at most four edges which belong to no subdivisions of K3,3 in G.

Nearly uniform distribution of edges amo
Nearly uniform distribution of edges among k-subgraphs of a graph
✍ Jozef Širáň; Zsolt Tuza 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 671 KB

## Abstract We investigate the behavior of the function __f__ = __f(n, k, e)__ defined as the smallest integer with the following property: If in a graph on __n__ vertices, the numbers of edges in any two induced subgraphs on __k__ vertices differ by at most __e__, then the graph or its complement

The number of edges in a subgraph of a H
The number of edges in a subgraph of a Hamming graph
✍ R. Squier; B. Torrence; A. Vogt 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 363 KB

G be a subgraph of the Cartesian product Hamming graph (Kp)r with n vertices. Then the number of edges of G is at most (1/2)(p -1) log, n, with equality holding if and only G is isomorphic to (Kp)s for some s 5 r.