# A note on pm-compact bipartite graphs

Discussiones Mathematicae Graph Theory (2014)

- Volume: 34, Issue: 2, page 409-413
- ISSN: 2083-5892

## Access Full Article

top## Abstract

top## How to cite

topJinfeng Liu, and Xiumei Wang. "A note on pm-compact bipartite graphs." Discussiones Mathematicae Graph Theory 34.2 (2014): 409-413. <http://eudml.org/doc/267552>.

@article{JinfengLiu2014,

abstract = {A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2 has an ear decomposition such that each graph in the decomposition sequence is also PM-compact, which implies that G is matching-covered},

author = {Jinfeng Liu, Xiumei Wang},

journal = {Discussiones Mathematicae Graph Theory},

keywords = {perfect matching; PM-compact graph; matching-covered graph},

language = {eng},

number = {2},

pages = {409-413},

title = {A note on pm-compact bipartite graphs},

url = {http://eudml.org/doc/267552},

volume = {34},

year = {2014},

}

TY - JOUR

AU - Jinfeng Liu

AU - Xiumei Wang

TI - A note on pm-compact bipartite graphs

JO - Discussiones Mathematicae Graph Theory

PY - 2014

VL - 34

IS - 2

SP - 409

EP - 413

AB - A graph is called perfect matching compact (briefly, PM-compact), if its perfect matching graph is complete. Matching-covered PM-compact bipartite graphs have been characterized. In this paper, we show that any PM-compact bipartite graph G with δ (G) ≥ 2 has an ear decomposition such that each graph in the decomposition sequence is also PM-compact, which implies that G is matching-covered

LA - eng

KW - perfect matching; PM-compact graph; matching-covered graph

UR - http://eudml.org/doc/267552

ER -

## References

top- [1] C.A. Barefoot, R.C. Entringer and L.A. Sz´ekely, Extremal values for ratios of dis- tances in trees, Discrete Appl. Math. 80 (1997) 37-56. doi:10.1016/S0166-218X(97)00068-1[Crossref]
- [2] A.A. Dobrynin, R. Entringer and I. Gutman, Wiener index of trees: theory and applications, Acta Appl. Math 66 (2001) 211-249. doi:10.1023/A:1010767517079[Crossref] Zbl0982.05044
- [3] L. Johns and T.C. Lee, S-distance in trees, in: Computing in the 90’s (Kalamazoo, MI, 1989), Lecture Notes in Comput. Sci., 507, N.A. Sherwani, E. de Doncker and J.A. Kapenga (Ed(s)), (Springer, Berlin, 1991) 29-33. doi:10.1007/BFb0038469[Crossref]
- [4] T. Lengyel, Some graph problems and the realizability of metrics by graphs, Congr. Numer. 78 (1990) 245-254 Zbl0862.05038

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.