Results 71 to 80 of about 2,022 (201)
, 2008 1. Introduction A lattice in the plane divides the plane into elementary regions. A tile is the union oftwo elementary regions that share an edge. A region is a connected region in the plane whose boundary consists of lattice segments.
Perfect Powers
core
Enumeration Of Perfect Matchings In Graphs With Reflective Symmetry
, 1997 . A plane graph is called symmetric if it is invariant under the reflection across some straight line. We prove a result that expresses the number of perfect matchings of a large class of symmetric graphs in terms of the product of the number of ...
Mihai Ciucu, Ciucu, Mihai
core +1 more source
Finding Perfect Matchings in Bipartite Hypergraphs
, 2017 Haxell's condition [14] is a natural hypergraph analog of Hall's condition, which is a well-known necessary and sufficient condition for a bipartite graph to admit a perfect matching.
Annamalai, Chidambaram +1 more
core +1 more source
Perfect Matchings in Claw-free Cubic Graphs [PDF]
, 2011 Lovasz and Plummer conjectured that there exists a fixed positive constant c such that every cubic n-vertex graph with no cutedge has at least 2(cn) perfect matchings. Their conjecture has been verified for bipartite graphs by Voorhoeve and planar graphs
Oum, Sang-il
core
Perfect k-Colored Matchings and (k+2)-Gonal Tilings [PDF]
, 2018 We derive a simple bijection between geometric plane perfect matchings on 2n points in convex position and triangulations on n+2 points in convex position.
Aichholzer, O +3 more
core +1 more source
Perfect matchings: Modified Aztec diamonds, covering graphs andn-matchings
, 1997 In the Introduction, we present the problems we are going to study and we establish the basic definitions, concepts and results that are used throughout.
Cransac, Adriana Badauta
core
Finding all the perfect matchings in bipartite graphs
, 1994 This paper describes an algorithm for finding all the perfect matchings in a bipartite graph. By using the binary partitioning method, our algorithm requires O(c(n+m)+n2.5) computational effort and O(nm) memory storage, (where n denotes the number of ...
Matsui, T., Fukuda, K.
core +2 more sources
Graphical condensation for enumerating perfect matchings
, 2004 The method of graphical condensation for enumerating perfect matchings was found by Propp (Theoret. Comput. Sci. 303 (2003) 267), and was generalized by Kuo (Theoret. Comput. Sci. 319 (2004) 29).
Yan, Weigen +3 more
core +1 more source
Z-TRANSFORMATION GRAPHS OF PERFECT MATCHINGS OF HEXAGONAL SYSTEMS [PDF]
, 1988 Let H be a hexagonal system. We define the Z-transformation graph Z(H) to be the graph where the vertices are the perfect matchings of H and where two perfect matchings are joined by an edge provided their symmetric difference is a hexagon of H. We prove
Zhang, F. J. +3 more
core +2 more sources
On the index of tricyclic graphs with perfect matchings
, 2009 Let T(2k) be the set of all tricyclic graphs on 2k(k⩾2) vertices with perfect matchings. In this paper, we discuss some properties of the connected graphs with perfect matchings, and then determine graphs with the largest index in T(2k)
Geng, Xianya, Li, Shuchao, Li, Xuechao
core +1 more source