Plane elementary bipartite graph

Results 111 to 120 of about 167 (120)

Some of the next articles are maybe not open access.

Regular Coronoids and Ear Decompositions of Plane Elementary Bipartite Graphs

2007
A connected bipartite graph is called elementary (or normal) if its every edge is contained in some perfect matching. In rho classification of coronoids due to Cyvin et al., normal coronoids are divided into two types: regular and half essentially disconnected.
openaire +1 more source

Existence of perfect matchings in a plane bipartite graph

Czechoslovak Mathematical Journal, 2010
Zhongyuan Che
exaly

Direct Sum of Distributive Lattices on the Perfect Matchings of a Plane Bipartite Graph

Order, 2010
Heping Zhang
exaly

Total Z-transformation graphs of perfect matching of plane bipartite graphs

Electronic Notes in Discrete Mathematics, 2000
Heping Zhang, Fuji Zhang
exaly

Polychromatic 4-coloring of cubic bipartite plane graphs

Discrete Mathematics, 2012
Matthew J Katz, Atsuhiro Nakamoto
exaly

An Upper Bound on the Number of Edges in an Almost Planar Bipartite Graph

Journal of Mathematical Sciences, 2014
D V Karpov, Karpov D V
exaly

The Z-Transformation graph for an outerplane bipartite graph has a Hamilton path

Applied Mathematics Letters, 2004
Heping Zhang, Haiyuan Yao
exaly