✦ LIBER ✦

The Disintegration of Yugoslaviaby Martin van den Heuvel; Jan G. Siccama

✍ Scribed by Review by: David Hunt

Book ID: 125171677
Publisher: Maney Publishing
Year: 1993
Tongue: English
Weight: 120 KB
Volume: 71
Category: Article
ISSN: 0037-6795
DOI: 10.2307/4211285

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Disintegration of Yugoslavia.by Mart

The Disintegration of Yugoslavia.by Martin van den Heuvel; Jan G. Siccama

✍ Review by: John K. Cox 📂 Article 📅 1993 🏛 University of Illinois at Urbana-Champaign 🌐 English ⚖ 293 KB

Influence of charge-compensating ions on

Influence of charge-compensating ions on the luminescence of vanadium-activated sulfates: G. Blasse and G. P. M. van den Heuvel. Physical Laboratory, Sorbonnelaan 4, Utrecht, The Netherlands

📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 106 KB

Intra-European Co-operation in the field

Intra-European Co-operation in the field of Energy

✍ Jan van den Heuvel 📂 Article 📅 1957 🏛 John Wiley and Sons 🌐 English ⚖ 687 KB

Coloring the square of a planar graph

✍ Jan van den Heuvel; Sean McGuinness 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

## Abstract We prove that for any planar graph __G__ with maximum degree Δ, it holds that the chromatic number of the square of __G__ satisfies χ(__G__^2^) ≤ 2Δ + 25. We generalize this result to integer labelings of planar graphs involving constraints on distances one and two in the graph. © 2002

On the Edge Connectivity, Hamiltonicity,

On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs

✍ Jan van den Heuvel; Bill Jackson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 191 KB

Let G be a connected k-regular vertex-transitive graph on n vertices. For S V(G) let d(S) denote the number of edges between S and V(G)"S. We extend results of Mader and Tindell by showing that if d(S)< 2 9 (k+1) 2 for some S V(G) with 1 3 (k+1) |S| 1 2 n, then G has a factor F such that GÂE(F ) is

Transversals of subtree hypergraphs and

Transversals of subtree hypergraphs and the source location problem in digraphs

✍ Jan van den Heuvel; Matthew Johnson 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB

## Abstract A hypergraph __H__ = (__V__,__E__) is a subtree hypergraph if there is a tree __T__ on __V__ such that each hyperedge of __E__ induces a subtree of __T__. Since the number of edges of a subtree hypergraph can be exponential in __n__ = |__V__|, one can not always expect to be able to fin