✦ LIBER ✦

Bicolored Matchings in Some Classes of Graphs

✍ Scribed by M. C. Costa; D. de Werra; C. Picouleau; B. Ries

Publisher: Springer Japan
Year: 2007
Tongue: English
Weight: 137 KB
Volume: 23
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-006-0686-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Addendum to “Bicolored Matchings in Some

Addendum to “Bicolored Matchings in Some Classes of Graphs”

✍ M. C. Costa; D. de Werra; C. Picouleau; B. Ries 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 55 KB

Dominator Colorings in Some Classes of G

Dominator Colorings in Some Classes of Graphs

✍ Mustapha Chellali; Frédéric Maffray 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 188 KB

Maximum matchings in a class of random g

Maximum matchings in a class of random graphs

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

Some classes of perfectly orderable grap

Some classes of perfectly orderable graphs

✍ C. T. Hoàng; B. A. Reed 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 815 KB

In 1981, Chvatal defined the class of perfectly orderable graphs. This class of perfect graphs contains the comparability graphs and the triangulated graphs. In this paper, we introduce four classes of perfectly orderable graphs, including natural generalizations of the comparability and triangulate

Matching polynomials of two classes of g

Matching polynomials of two classes of graphs

✍ Fu-ji Zhang; Ming-kun Zhou 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 616 KB

An Efficient Parallel Algorithm for Maxi

An Efficient Parallel Algorithm for Maximum Matching for Some Classes of Graphs

✍ I. Parfenoff 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 403 KB

The P 4 -tidy graphs were introduced by I. Rusu to generalize some already known classes of graphs with few induced P 4 (cographs, P 4 -sparse graphs, P 4 -lite graphs). Here, we propose an extension of R. Lin and S. Olariu's work (1994. J. Parallel Distributed Computing 22, 26 36.) on cographs, usi