𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Totally equimatchable graphs

✍ Scribed by Jerzy Topp; Preben D. Vestergaard

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
308 KB
Volume
164
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

Equimatchable factor-critical graphs
Equimatchable factor-critical graphs
✍ Odile Favaron πŸ“‚ Article πŸ“… 1986 πŸ› John Wiley and Sons 🌐 English βš– 423 KB

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, w

Totally symmetric colored graphs
Totally symmetric colored graphs
✍ Mariusz Grech; Andrzej Kisielewicz πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 177 KB

## Abstract In this paper we describe almost all edge‐colored complete graphs that are fully symmetric with respect to colors and transitive on every set of edges of the same color. This generalizes the recent description of self‐complementary symmetric graphs by Peisert and gives examples of permu

Totally Critical Even Order Graphs
Totally Critical Even Order Graphs
✍ G.M. Hamilton; A.J.W. Hilton; H.R.F. Hind πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 138 KB

A graph is totally critical if it is Type 2, connected, and the removal of any edge reduces the total chromatic number. A good characterization of all totally critical graphs is unlikely as Sanchez-Arroyo showed that determining the total chromatic number of a graph is an NP-hard problem. In this pa