AbstractA hexagonal system is a connected plane graph without cut vertices in which each interior face is a regular hexagon. A linear algorithm is proposed to find a perfect matching in a hexagonal system or show that there are none. This improves on the complexity of previous methods
It is a longstanding open problem whether there exists a polynomial size description of the perfect ...
AbstractThis paper considers an algorithm for finding a perfect matching, if there is one, in a bipa...
AbstractIn this paper we establish a simple criterion which enables us to determine whether or not a...
AbstractA hexagonal system is a connected plane graph without cut vertices in which each interior fa...
AbstractA hexagonal system is a finite 2-connected plane graph in which every interior face is bound...
. A simple way to calculate the number of k-matchings, k 5, in hexagonal systems is presented. Some...
summary:We give a necessary and sufficient condition for the existence of perfect matchings in a pla...
AbstractLet H be a hexagonal system. We define the Z-transformation graph Z(H) to be the graph where...
AbstractIn this paper, we introduce the concept of a forcing single edge in a hexagonal system H, wh...
Matching: A matching M of a graph G = (V,E) is a subset of the edges in E such that no two edges in ...
Let H be a hexagonal system. We define the Z-transformation graph Z(H) to be the graph where the ver...
AbstractA simple way to calculate the number of k-matchings, k ⩽ 5, in hexagonal systems is presente...
AbstractAn edge of a generalized hexagonal system H is said to be not fixed if it belongs to some bu...
A linear programming (LP) approach is proposed for the weighted graph matching problem. A linear pro...
AbstractWe show that for a hypergraph H that is separable and has the Helly property, the perfect ma...
It is a longstanding open problem whether there exists a polynomial size description of the perfect ...
AbstractThis paper considers an algorithm for finding a perfect matching, if there is one, in a bipa...
AbstractIn this paper we establish a simple criterion which enables us to determine whether or not a...
AbstractA hexagonal system is a connected plane graph without cut vertices in which each interior fa...
AbstractA hexagonal system is a finite 2-connected plane graph in which every interior face is bound...
. A simple way to calculate the number of k-matchings, k 5, in hexagonal systems is presented. Some...
summary:We give a necessary and sufficient condition for the existence of perfect matchings in a pla...
AbstractLet H be a hexagonal system. We define the Z-transformation graph Z(H) to be the graph where...
AbstractIn this paper, we introduce the concept of a forcing single edge in a hexagonal system H, wh...
Matching: A matching M of a graph G = (V,E) is a subset of the edges in E such that no two edges in ...
Let H be a hexagonal system. We define the Z-transformation graph Z(H) to be the graph where the ver...
AbstractA simple way to calculate the number of k-matchings, k ⩽ 5, in hexagonal systems is presente...
AbstractAn edge of a generalized hexagonal system H is said to be not fixed if it belongs to some bu...
A linear programming (LP) approach is proposed for the weighted graph matching problem. A linear pro...
AbstractWe show that for a hypergraph H that is separable and has the Helly property, the perfect ma...
It is a longstanding open problem whether there exists a polynomial size description of the perfect ...
AbstractThis paper considers an algorithm for finding a perfect matching, if there is one, in a bipa...
AbstractIn this paper we establish a simple criterion which enables us to determine whether or not a...
DOI
Add to ORKG