✦ LIBER ✦

Equimatchable factor-critical graphs

✍ Scribed by Odile Favaron

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 423 KB
Volume: 10
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190100403

No coin nor oath required. For personal study only.

✦ Synopsis

A simple graph G(X, €1 is factor-critical if the induced subgraph (Xx ) admits a perfect matching for every vertex x of G. It is equimatchable if every maximal matching of G is maximum. The equimatchable non-factor-critical graphs have been studied by Lesk, Plummer, and Pulleyblank. In this paper, we study the equimatchable factor-critical graphs; in particular we show that if such a graph is two-connected, it is hamiltonian.

📜 SIMILAR VOLUMES

Totally equimatchable graphs

✍ Jerzy Topp; Preben D. Vestergaard 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 308 KB

A subset X of vertices and edges of a graph G is totally matching if no two elements of X are adjacent or incident. In this paper we determine all graphs in which every maximal total matching is maximum.

Bounding the Size of Equimatchable Graph

Bounding the Size of Equimatchable Graphs of Fixed Genus

✍ Ken-ichi Kawarabayashi; Michael D. Plummer 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 140 KB

Some results on fractionaln-factor-criti

Some results on fractionaln-factor-critical graphs

✍ Jiguo Yu; Qiuju Bian; Guizhen Liu; Na Wang 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 192 KB

(2,k)-Factor-Critical Graphs and Toughne

(2,k)-Factor-Critical Graphs and Toughness

✍ Mao-Cheng Cai; Odile Favaron; Hao Li 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 81 KB

(3,k)-Factor-Critical Graphs and Toughne

(3,k)-Factor-Critical Graphs and Toughness

✍ Minýong Shi; Xudong Yuan; Mao-cheng Cai; Odile Favaron 📂 Article 📅 1999 🏛 Springer Japan 🌐 English ⚖ 103 KB

Factor-Critical Graphs with Given Number

Factor-Critical Graphs with Given Number of Maximum Matchings

✍ Yan Liu; Guiying Yan 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 156 KB