✦ LIBER ✦

A Survey on Contractible Edges in Graphs of a Prescribed Vertex Connectivity

✍ Scribed by Matthias Kriesell

Publisher: Springer Japan
Year: 2002
Tongue: English
Weight: 252 KB
Volume: 18
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730200000

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-contractible edges in a 3-connected

Non-contractible edges in a 3-connected graph

✍ Yoshimi Egawa; Katsuhiro Ota; Akira Saito; Xingxing Yu 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 412 KB

Contractible edges in a k-connected grap

Contractible edges in a k-connected graph (K1 + P4)-free graph

✍ Kiyoshi Ando 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 215 KB

Maximum Number of Contractible Edges on

Maximum Number of Contractible Edges on Hamiltonian Cycles of a 3-Connected Graph

✍ Kyo Fujita 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 252 KB

Order of a Graph with given Vertex and E

Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree

✍ Mohit Singh; Amitabha Tripathi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 120 KB

On the edge-connectivity vector of a gra

On the edge-connectivity vector of a graph

✍ Linda M. Lesniak; Raymond E. Pippert 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

A Degree Sum Condition for the Existence

A Degree Sum Condition for the Existence of a Contractible Edge in a κ-Connected Graph

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 184 KB

It is known that a noncomplete }-connected graph of minimum degree of at least w 5} 4 x contains a }-contractible edge, i.e., an edge whose contraction yields again a }-connected graph. Here we prove the stronger statement that a noncomplete }-connected graph for which the sum of the degrees of any