Results 181 to 189 of about 1,265 (189)

A comparison between 1-factor count and resonant pattern count in plane non-bipartite graphs

Journal of Mathematical Chemistry, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Heping, He, Jinghua
openaire   +2 more sources

The connectivity of matching transformation graphs of cubic bipartite plane graphs.

Ars Comb., 2001
Let \(G\) be a cubic bipartite plane graph that has a perfect matching. It is shown that for any perfect matching \(M\) of \(G\), some face of \(G\) is \(M\)-alternating. Conversely, every face of \(G\) is \(M\)-alternating for some perfect matching \(M\) of \(G\). As proved by \textit{D. Wang} [J. Math.
openaire   +1 more source

A Simple Linear Time Algorithm for Finding Even Triangulations of 2-Connected Bipartite Plane Graphs

2002
Recently, Hoffmann and Kriegel proved an important combinatorial theorem [4]: Every 2-connected bipartite plane graph G has a triangulation in which all vertices have even degree (it's called an even triangulation). Combined with a classical Whitney's Theorem, this result implies that every such a graph has a 3-colorable plane triangulation. Using this
Huaming Zhang, Xin He 0005
openaire   +1 more source

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

Kekule patterns and Clar patterns in bipartite plane graphs

Journal of Chemical Information and Computer Sciences, 1995
Peter E. John, Horst Sachs, Maolin Zheng
openaire   +1 more source

Resonance of Plane Bipartite Graphs.

Ars Comb., 2007
Jingrong Chen, Heping Zhang
openaire  

Bipartite Graph based Multi-view Clustering

IEEE Transactions on Knowledge and Data Engineering, 2020
Lusi Li, Haibo He
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  

Non 3-Choosable Bipartite Graphs and The Fano Plane.

Ars Comb., 2005
Shannon L. Fitzpatrick, Gary MacGillivray   +1 more
openaire