Title of article
A characterization of PM-compact bipartite and near-bipartite graphs
Author/Authors
Wang، نويسنده , , Xiumei and Lin، نويسنده , , Yixun and Carvalho، نويسنده , , Marcelo H. and Lucchesi، نويسنده , , Clلudio L. and Sanjith، نويسنده , , Christopher G. and Little، نويسنده , , C.H.C.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
12
From page
772
To page
783
Abstract
The perfect-matching polytope of a graph G is the convex hull of the incidence vectors of all perfect matchings in G . This paper characterizes bipartite and nearly bipartite graphs whose 1-skeleton graphs of perfect-matching polytopes have diameter 1.
Keywords
Perfect-matching polytope , Perfect-matching graph
Journal title
Discrete Mathematics
Serial Year
2013
Journal title
Discrete Mathematics
Record number
1600270
Link To Document