𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Topological minors in line graphs — A proof of Zha’s conjecture

✍ Scribed by Krakovski, Roi

Book ID
121555524
Publisher
Springer-Verlag
Year
2014
Tongue
English
Weight
646 KB
Volume
34
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proof of a conjecture on -tuple dominati
Proof of a conjecture on -tuple domination in graphs
✍ Guangjun Xu; Liying Kang; Erfang Shan; Hong Yan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 142 KB

Let G = (V, E) be a graph and N G [v] the closed neighborhood of a vertex v in G. For k ∈ N, the minimum cardinality of a set In this note we prove the following conjecture of Rautenbach and Volkmann [D. Rautenbach, L. Volkmann, New bounds on the k-domination number and the k-tuple domination numbe

Proof of a conjecture on cycles in a bip
Proof of a conjecture on cycles in a bipartite graph
✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 2 views

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k ≥ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n ≥ 3k, i.e., M (k) ≤ 3k. W

Thomassen's conjecture implies polynomia
Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
✍ Roman Kužel; Zdeněk Ryjáček; Petr Vrána 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB

## Abstract A graph __G__ is 1‐Hamilton‐connected if __G__−__x__ is Hamilton‐connected for every __x__∈__V__(__G__), and __G__ is 2‐edge‐Hamilton‐connected if the graph __G__+ __X__ has a hamiltonian cycle containing all edges of __X__ for any __X__⊂__E__^+^(__G__) = {__xy__| __x, y__∈__V__(__G__)}