Displaying similar documents to “Sequentially perfect and uniform one-factorizations of the complete graph.”

Variations of uniform completeness related to realcompactness

Miroslav Hušek (2017)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Various characterizations of realcompactness are transferred to uniform spaces giving non-equivalent concepts. Their properties, relations and characterizations are described in this paper. A Shirota-like characterization of certain uniform realcompactness proved by Garrido and Meroño for metrizable spaces is generalized to uniform spaces. The paper may be considered as a unifying survey of known results with some new results added.

A Maximum Resonant Set of Polyomino Graphs

Heping Zhang, Xiangqian Zhou (2016)

Discussiones Mathematicae Graph Theory

Similarity:

A polyomino graph P is a connected finite subgraph of the infinite plane grid such that each finite face is surrounded by a regular square of side length one and each edge belongs to at least one square. A dimer covering of P corresponds to a perfect matching. Different dimer coverings can interact via an alternating cycle (or square) with respect to them. A set of disjoint squares of P is a resonant set if P has a perfect matching M so that each one of those squares is M-alternating....

A note on pm-compact bipartite graphs

Jinfeng Liu, Xiumei Wang (2014)

Discussiones Mathematicae Graph Theory

Similarity:

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