✦ LIBER ✦

Graphs with every matching contained in a cycle

✍ Scribed by Abdelhamid Benhocine; A.Paweł Wojda

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 639 KB
Volume: 118
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90049-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs such that every two edges are con

Graphs such that every two edges are contained in a shortest cycle

✍ Nathalie Homobono; Claudine Peyrat 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 665 KB

A graph G is said to have depth 6 if every path of length d + 1 is contained in a shortest cycle. First we answer by the negative a problem of Neumaier [2], by constructing for every 6, a graph of depth 6 which is neither a cyck nor a uniform subdivision of another graph. Then we characterize the gr

On large matchings and cycles in sparse

On large matchings and cycles in sparse random graphs

✍ A.M Frieze 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 666 KB

Let k be a fixed positive integer. A graph H has property Mk if it contains [½k] edge disjoint hamilton cycles plus a further edge disjoint matching which leaves at most one vertex isolated, if k is odd. Let p = c/n, where c is a large enough constant. We show that G,,p a.s. contains a vertex induce

Long cycles in graphs containing a 2-fac

Long cycles in graphs containing a 2-factor with many odd components

✍ J van den Heuvel 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 195 KB

Every (p, p-2) graph is contained in its

Every (p, p-2) graph is contained in its complement

✍ David Burns; Seymour Schuster 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 1 views

## Abstract The following is proved: If __G__ is graph of order __p__ (≥2) and size __p__‐2, then there exists an isomorphic embedding of __G__ into its complement.

Vertices contained in every minimum domi

Vertices contained in every minimum dominating set of a tree

✍ Mynhardt, C. M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB

In this article we begin the study of the vertex subsets of a graph G which consist of the vertices contained in all, or in no, respectively, minimum dominating sets of G. We characterize these sets for trees, and also obtain results on the vertices contained in all minimum independent dominating se

Covering a graph with cycles

✍ Hong Wang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 444 KB

## Abstract Let __k__ and __n__ be two integers such that __k__ ≥ 0 and __n__ ≥ 3(__k__ + 1). Let __G__ be a graph of order __n__ with minimum degree at least ⌈(__n__ + __k__)/2⌉. Then __G__ contains __k__ + 1 independent cycles covering all the vertices of __G__ such that __k__ of them are triangl