𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the connectedness of optimum-degeneracy graphs

✍ Scribed by Peter Zörnig; Tomas Gal

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
516 KB
Volume
95
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the cover degeneracy of graphs
A note on the cover degeneracy of graphs
✍ Li Zhang; Baoyindureng Wu 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 1 views

## Abstract We give a 4‐chromatic planar graph, which admits a vertex partition into three parts such that the union of every two of them induces a forest. This solves a problem posed by Böhme. Also, by constructing an infinite sequence of graphs, we show that the cover degeneracy can be arbitraril

Determining the hamilton-connectedness o
Determining the hamilton-connectedness of certain vertex-transitive graphs
✍ Ming Jiang; Frank Ruskey 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 731 KB

Faber and Moore have proposed a class of vertex-transitive digraphs as a model of directed inconnection networks. These networks have attractive degree versus diameter properties. We show that these digraphs are Hamiltonian and provide necessary and sufficient conditions for the existence of a Hamil

On stability of Hamilton-connectedness u
On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
✍ Zdeněk Ryjáček; Petr Vrána 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 269 KB 👁 1 views

We show that, in a claw-free graph, Hamilton-connectedness is preserved under the operation of local completion performed at a vertex with 2-connected neighborhood. This result proves a conjecture by Bollobás et al.