𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Planar graphs, Hamilton cycles and extreme independence number

✍ Scribed by Samuel Jurkiewicz

Book ID
112691252
Publisher
Springer US
Year
1994
Tongue
English
Weight
562 KB
Volume
50
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Hamilton cycles in certain planar gra
On Hamilton cycles in certain planar graphs
✍ Sanders, Daniel P. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 586 KB

Let G be a 2-connected plane graph with outer cycle XG such that for every minimal vertex cut S of G with IS1 5 3, every component of G \ S contains a vertex of XG. A sufficient condition for G to be Hamiltonian is presented. This theorem generalizes both Tutte's theorem that every 4-connected plan

Hamilton Cycles in Planar Graphs and Ven
Hamilton Cycles in Planar Graphs and Venn Diagrams
✍ Kiran B. Chilakamarri; Peter Hamburger; Raymond E. Pippert πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 258 KB

Using graph theory, we prove Gru nbaum's conjecture: Every Venn diagram of n curves can be extended to a Venn diagram of n+1 curves by the addition of a suitable simple closed curve.

Independence trees and Hamilton cycles
Independence trees and Hamilton cycles
✍ Broersma, Hajo; Tuinstra, Hilde πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 268 KB

Let G be a connected graph on n vertices. A spanning tree T of G is called an independence tree, if the set of end vertices of T (vertices with degree one in T ) is an independent set in G. If G has an independence tree, then Ξ± t (G) denotes the maximum number of end vertices of an independence tree