Results 91 to 100 of about 2,022 (201)
Z-transformation graphs of perfect matchings of plane bipartite graphs
, 2004 Let G be a plane bipartite graph with at least two perfect matchings. The Z-transformation graph, ZF(G), of G with respect to a specific set F of faces is defined as a graph on the perfect matchings of G such that two perfect matchings M1 and M2 are ...
Zhang, Heping, Zhang, Fuji, Yao, Haiyuan
core +1 more source
Resonance Graph of Perfect Matchings
, 2019 Let G be a graph with perfect matchings and let C be a set of linearly independent even cycles of G of width at most 2. The resonance graph R(G, C) is a graph with the vertex set M a subset of M(G) such that two vertices Mi and Mj are adjacent if and ...
Aluoch, James
core
A Cohomology Theory for Planar Trivalent Graphs with Perfect Matchings
, 2023 We introduce a new cohomology theory for planar trivalent graphs with perfect matchings. The graded Euler characteristic of the cohomology is a one variable polynomial called the 2-factor polynomial that, if nonzero when evaluated at one, implies that ...
Baldridge, Scott
core
The n-queens completion problem. [PDF]
Res Math Sci, 2022 Glock S, Munhá Correia D, Sudakov B.
europepmc +1 more source
COMPUTING THE ANTI-KEKULÉ NUMBER OF CERTAIN NANOTUBES AND NANOCONES
Studia Universitatis Babes-Bolyai Chemia, 2015 Let G(V,E) be a connected graph. A set M subset of E is called a matching if no two edges in M have a common end-vertex. A matching M in G is perfect if every vertex of G is incident with an edge in M.
Mehar Ali MALIK, Muhammad IMRAN
doaj
Power Graphs of Finite Groups Determined by Hosoya Properties. [PDF]
Entropy (Basel), 2022 Ali F +4 more
europepmc +1 more source
Perfect matchings after vertex deletions in n-dimensional lattice graphs
, 2005 This thesis studies lattice graphs which are readily seen to have many perfect matchings and considers whether if we delete vertices the resulting graphs continue to have perfect matchings.
Yang, Hangjun
core
Applications of maximum matching by using bipolar fuzzy incidence graphs. [PDF]
PLoS One, 2023 Rehman FU, Rashid T, Hussain MT.
europepmc +1 more source
On Hamiltonian Graphs and Perfect Matchings
, 1978 The main theorem gives necessary and sufficient conditions for graphs having an even number of vertices to be Hamiltonian in terms of its perfect matchings.
Solow, Daniel
core
Maximum Matchings in Geometric Intersection Graphs. [PDF]
Discrete Comput Geom, 2023 Bonnet É, Cabello S, Mulzer W.
europepmc +1 more source