Results 171 to 180 of about 1,265 (189)
Some of the next articles are maybe not open access.
Structural properties of resonance graphs of plane elementary bipartite graphs
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhongyuan Che
exaly +2 more sources
Direct Sum of Distributive Lattices on the Perfect Matchings of a Plane Bipartite Graph
Order, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heping Zhang
exaly +2 more sources
Ars Comb., 1999 Summary: Let \(G\) be a connected plane bipartite graph. The \(Z\)-transformation graph \(Z(G)\) is a graph where the vertices are the perfect matchings of \(G\) and where two perfect matchings are joined by an edge provided their symmetric difference is the boundary of an interior face of \(G\). For a plane elementary bipartite graph \(G\) it is shown
Zhang, HP, Zhang, FJ
openaire +2 more sources
The Z-Transformation graph for an outerplane bipartite graph has a Hamilton path
Applied Mathematics Letters, 2004 The Z-transformation graph of perfect matchings of a plane bipartite graph G has the perfect matchings of G as vertices, two perfect matchings being adjacent if their symmetric difference forms a cycle that is the boundary of an interior face of G.
Heping Zhang, Haiyuan Yao
exaly +2 more sources
Plane Elementary Bipartite Graphs with Forcing or Anti-forcing Edges
Graphs and Combinatorics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhongyuan Che, Zhibo Chen 0003
openaire +1 more source
A Distributive Lattice on the Set of Perfect Matchings of a Plane Bipartite Graph
Order, 2003Perfect matchings of (finite simple) graphs \(G\) have been widely studied over a (relatively) long time and the literature on this subject is considerable. Even so, interesting additions continue to be made as is quite clear from this paper where \(M(G)\), the set of perfect matchings, is provided a graph structure (edge means matchings differ by only
Peter Che Bor Lam, Heping Zhang
openaire +2 more sources
PARTITIONS OF COMPLETE BIPARTITE GEOMETRIC GRAPHS INTO PLANE PERFECT MATCHINGS
Far East Journal of Mathematical Sciences (FJMS), 2019Summary: We consider the following problem: Does every complete bipartite geometric graph \(K_{n,n}\) on a given set \(P\) of \(2n\) points have a partition of its edge set into \(n\) plane perfect matchings? We approach this problem by considering three different situations of \(P\), namely, when \(P\) is in convex position, double chain position and ...
Trao, Hazim Michman +3 more
openaire +1 more source
Normal Components, Kekulé Patterns, and Clar Patterns in Plane Bipartite Graphs
Journal of Mathematical Chemistry, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shiu, WC, Lam, PCB, Zhang, FJ, Zhang, HP
openaire +3 more sources