AbstractIn this paper, we introduce the concept of a forcing single edge in a hexagonal system H, which is an edge of H belonging to all but one perfect matching of H. We completely determine all the hexagonal systems with a forcing single edge. A generating function for the number of such systems is also given
Let H be a hexagonal system. We define the Z-transformation graph Z(H) to be the graph where the ver...
summary:We give a necessary and sufficient condition for the existence of perfect matchings in a pla...
AbstractWe show that for a hypergraph H that is separable and has the Helly property, the perfect ma...
AbstractIn this paper, we introduce the concept of a forcing single edge in a hexagonal system H, wh...
AbstractAn edge of a hexagonal system H is said to be forcing if it belongs to exactly one perfect m...
Abstract The anti-forcing number of a graph is the smallest number of edges that have to be removed ...
AbstractAn edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or...
AbstractAn edge of a generalized hexagonal system H is said to be not fixed if it belongs to some bu...
AbstractA hexagonal system is a finite 2-connected plane graph in which every interior face is bound...
AbstractA hexagonal system is a connected plane graph without cut vertices in which each interior fa...
AbstractLet Ω denote the class of connected plane bipartite graphs with no pendant edges. A finite f...
AbstractIn this paper we establish a simple criterion which enables us to determine whether or not a...
AbstractThe concept of forcing faces of a plane bipartite graph was first introduced in Che and Chen...
AbstractIn this paper we give an O(n2) algorithm to determine fixed bonds and normal subhexagonal sy...
AbstractLet H be a hexagonal system. We define the Z-transformation graph Z(H) to be the graph where...
Let H be a hexagonal system. We define the Z-transformation graph Z(H) to be the graph where the ver...
summary:We give a necessary and sufficient condition for the existence of perfect matchings in a pla...
AbstractWe show that for a hypergraph H that is separable and has the Helly property, the perfect ma...
AbstractIn this paper, we introduce the concept of a forcing single edge in a hexagonal system H, wh...
AbstractAn edge of a hexagonal system H is said to be forcing if it belongs to exactly one perfect m...
Abstract The anti-forcing number of a graph is the smallest number of edges that have to be removed ...
AbstractAn edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or...
AbstractAn edge of a generalized hexagonal system H is said to be not fixed if it belongs to some bu...
AbstractA hexagonal system is a finite 2-connected plane graph in which every interior face is bound...
AbstractA hexagonal system is a connected plane graph without cut vertices in which each interior fa...
AbstractLet Ω denote the class of connected plane bipartite graphs with no pendant edges. A finite f...
AbstractIn this paper we establish a simple criterion which enables us to determine whether or not a...
AbstractThe concept of forcing faces of a plane bipartite graph was first introduced in Che and Chen...
AbstractIn this paper we give an O(n2) algorithm to determine fixed bonds and normal subhexagonal sy...
AbstractLet H be a hexagonal system. We define the Z-transformation graph Z(H) to be the graph where...
Let H be a hexagonal system. We define the Z-transformation graph Z(H) to be the graph where the ver...
summary:We give a necessary and sufficient condition for the existence of perfect matchings in a pla...
AbstractWe show that for a hypergraph H that is separable and has the Helly property, the perfect ma...
DOI
Add to ORKG