Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.disc.2012.12.015 | Discrete Mathematics |
Keywords | Field | DocType |
Perfect-matching polytope,Perfect-matching graph | Birkhoff polytope,Discrete mathematics,Complete bipartite graph,Combinatorics,Chordal graph,Bipartite graph,Cograph,Pancyclic graph,Mathematics,Strong perfect graph theorem,Dense graph | Journal |
Volume | Issue | ISSN |
313 | 6 | 0012-365X |
Citations | PageRank | References |
2 | 0.62 | 2 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiumei Wang | 1 | 15 | 5.71 |
| Yixun Lin | 2 | 162 | 22.53 |
| Marcelo H. De Carvalho | 3 | 105 | 21.35 |
| Cláudio Leonardo Lucchesi | 4 | 35 | 6.19 |
| G. Sanjith | 5 | 2 | 0.62 |
| Charles H. C. Little | 6 | 51 | 12.98 |