𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Thek-in-a-Path Problem for Claw-free Graphs

✍ Scribed by Jiří Fiala; Marcin Kamiński; Bernard Lidický; Daniël Paulusma

Publisher
Springer
Year
2010
Tongue
English
Weight
705 KB
Volume
62
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Closure Concept in Claw-Free Graphs
On a Closure Concept in Claw-Free Graphs
✍ Zdeněk Ryjáček 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 269 KB

If G is a claw-free graph, then there is a graph cl(G) such that (i) G is a spanning subgraph of cl(G), (ii) cl(G) is a line graph of a triangle-free graph, and (iii) the length of a longest cycle in G and in cl(G) is the same. A sufficient condition for hamiltonicity in claw-free graphs, the equiv

Upper total domination in claw-free grap
Upper total domination in claw-free graphs
✍ Odile Favaron; Michael A. Henning 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

## Abstract A set __S__ of vertices in a graph __G__ is a total dominating set of __G__ if every vertex of __G__ is adjacent to some vertex in __S__ (other than itself). The maximum cardinality of a minimal total dominating set of __G__ is the upper total domination number of __G__, denoted by Γ~__

A polynomial algorithm for the minimum w
A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs
✍ Wen-Lian HSU; George L. Nemhauser 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 688 KB

Discrete Mathematics 3X ( 19X2) 6S-71 North-Holland Publishing Company 65 Let G = (V, E) be a graph with a positive number wt(v) assigned to each L' E V. A weighted clique saver of the vertices of G is a collection of cliques with a non-negative weight yC. assigned to each clique C in the collection