𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Structure of Graphs with Low Obstacle Number

✍ Scribed by János Pach; Deniz Sarıöz

Publisher
Springer Japan
Year
2011
Tongue
English
Weight
419 KB
Volume
27
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On graphs with the maximum number of spa
On graphs with the maximum number of spanning trees
✍ Alexander K. Kelmans 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 814 KB

Let 3:; denote the set of simple graphs with n vertices and m edges, t ( G ) the number of spanning trees of a graph G , and F 2 H if t(K,\E(F))?t(K,\E(H)) for every s? max{u(F), u ( H ) } . We give a complete characterization of >-maximal (maximum) graphs in 3:; subject to m 5 n . This result conta

On the Ramsey number of trees versus gra
On the Ramsey number of trees versus graphs with large clique number
✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 335 KB

Chvatal established that r(T,, K,,) = (m -1 ) ( n -1 ) + 1, where T, , , is an arbitrary tree of order m and K, is the complete graph of order n. This result was extended by Chartrand, Gould, and Polimeni who showed K, could be replaced by a graph with clique number n and order n + 5 provided n 2 3

Structural theorem on plane graphs with
Structural theorem on plane graphs with application to the entire coloring number
✍ Borodin, Oleg V. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 477 KB 👁 1 views

In 1973, Kronk and Mitchem (Discrete Math. (5) 255-260) conjectured that the vertices, edges and faces of each plane graph G may be colored with D(G) + 4 colors, where D(G) is the maximum degree of G, so that any two adjacent or incident elements receive distinct colors. They succeeded in verifying