✦ LIBER ✦

The Hadwiger Number of Jordan Regions Is Unbounded

✍ Scribed by Otfried Cheong; Mira Lee

Book ID: 106149777
Publisher: Springer
Year: 2007
Tongue: English
Weight: 174 KB
Volume: 37
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-007-1346-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Hadwiger number of infinite graph

On the Hadwiger number of infinite graphs

✍ N. Seifter 📂 Article 📅 1992 🏛 Vandenhoeck & Ruprecht 🌐 German ⚖ 501 KB

On the Hadwiger numbers of starlike disk

On the Hadwiger numbers of starlike disks

✍ Zsolt Lángi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 393 KB

Hadwiger Number and the Cartesian Produc

Hadwiger Number and the Cartesian Product of Graphs

✍ L. Sunil Chandran; Alexandr Kostochka; J. Krishnam Raju 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 190 KB

The Hadwiger number of infinite vertex-t

The Hadwiger number of infinite vertex-transitive graphs

✍ Carsten Thomassen 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 679 KB

On the edge numbers of graphs with hadwi

On the edge numbers of graphs with hadwiger number 4 and 5

✍ E. Győri 📂 Article 📅 1982 🏛 Springer Netherlands 🌐 English ⚖ 313 KB

On Hadwiger's number— a problem of the N

On Hadwiger's number— a problem of the Nordhaus-Gaddum type

✍ M. Stiebitz 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 700 KB

Stiebitz, M., On Hadwiger's number-A problem of the Nordhaus-Gaddum type, Discrete Mathematics 101 (1992) 307-317. The Hadwiger number of a graph G = (V, E), denoted by q(G), is the maximum size of a complete graph to which G can be contracted. Let %((n, k):= {G 1 IV(G)1 = n and n(G) = k}. We shall