✦ LIBER ✦

Clique Vertex Magic Cover of a Graph

✍ Scribed by K. A. Sugeng; J. Ryan

Book ID: 107508949
Publisher: Springer-Verlag
Year: 2011
Tongue: English
Weight: 312 KB
Volume: 5
Category: Article
ISSN: 1661-8270
DOI: 10.1007/s11786-011-0077-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique covering of graphs

✍ L. Pyber 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 267 KB

Covering all cliques of a graph

✍ Zsolt Tuza 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 701 KB

The following conjecture of T. Gallai is proved: If G is a chordal graph on n vertices, such that all its maximal complete subgraphs have order at least 3, then there is a vertex set of cardinality ~n/3 which meets all maximal complete subgraphs of G. Further related results are given.

The vertex-cover polynomial of a graph

✍ F.M. Dong; M.D. Hendy; K.L. Teo; C.H.C. Little 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 87 KB

Extremal clique coverings of complementa

Extremal clique coverings of complementary graphs

✍ D. de Caen; P. Erdős; N. J. Pullmann; N. C. Wormald 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 264 KB

On covering all cliques of a chordal gra

On covering all cliques of a chordal graph

✍ Thomas Andreae; Carsten Flotow 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 205 KB

For a graph G = (V,E), a vertex set XC\_ V is called a clique if Ixl>~2 and the graph G [X] induced by X is a complete subgraph maximal under inclusion. We say that a vertex set T is a clique-transversal set if T N X ~ 0 for all cliques X of G, and define the clique-transversal number re(G) as the m

Covering the cliques of a graph with ver

Covering the cliques of a graph with vertices

✍ Paul Erdős; Tibor Gallai; Zsolt Tuza 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 681 KB

The following problem is investigated. Given an undirected graph G, determine the smallest cardinality of a vertex set that meets all complete subgraphs KC G maximal under inclusion.