Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Matching covered graphs and subdivisions of K-4 and (C-6)over-bar|
|Abstract:||We give a very simple proof that every non-bipartite matching covered graph contains a nice subgraph that is an odd subdivision of K-4 or (C) over bar(6). Tt follows immediately that every brick different From K-4 and (C) over bar(6) has an edge whose removal preserves the matching covered property. These are classical and very useful results due to Lovasz. (C) 1996 Academic Press, Inc.|
|Editor:||Academic Press Inc Jnl-comp Subscriptions|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.