 |
 |
Bauer, D. and Broersma, H.J. and Morgana, A. and Schmeichel, E.
(2007)
Tutte sets in graphs I: Maximal tutte sets and D-graphs.
Journal of Graph Theory, 55 (4).
.
ISSN 0364-9024
*** ISI Impact 0,561 ***
Full text available as: Official URL: http://dx.doi.org/10.1002/jgt.20243  AbstractA well-known formula of Tutte and Berge expresses the size of a maximum matching in a graph in terms of what is usually called the deficiency of . A subset of for which this deficiency is attained is called a Tutte set of . While much is known about maximum matchings, less is known about the structure of Tutte sets. In this article, we study the structural aspects of maximal Tutte sets in a graph . Towards this end, we introduce a related graph . We first show that the maximal Tutte sets in are precisely the maximal independent sets in its -graph , and then continue with the study of -graphs in their own right, and of iterated -graphs. We show that is isomorphic to a spanning subgraph of , and characterize the graphs for which and for which . Surprisingly, it turns out that for every graph with a perfect matching, . Finally, we characterize bipartite -graphs and comment on the problem of characterizing -graphs in general. | Item Type: | Article |
|---|
| Research Group: | EWI-DMMP: Discrete Mathematics and Mathematical Programming |
|---|
| Research Program: | CTIT-IE&ICT: Industrial Engineering and ICT |
|---|
| ID Code: | 10335 |
|---|
| Status: | Published |
|---|
| Deposited On: | 13 July 2007 |
|---|
| Refereed: | Yes |
|---|
| International: | Yes |
|---|
| ISI Impact Factor: | 0,561 |
|---|
| More Information: | statisticsmetis |
|---|
Export this item as: To request a copy of the PDF please email us request copy To correct this item please ask your editor Repository Staff Only: edit this item
|
 |
 |