AbstractAn edge of a generalized hexagonal system H is said to be not fixed if it belongs to some but not all perfect matchings of H. In this paper we give a necessary and sufficient condition for a generalized hexagonal system in which every edge is not fixed. Applying the above result to complete generalized hexagonal systems, we obtain a simple criterion to determine whether or not each hexagon of a complete generalized hexagonal system is resonant, and give a new and simpler proof of the main theorem of [4]
AbstractA connected graph G is said to be k-cycle resonant if, for 1 ⩽t⩽k, any t disjoint cycles in ...
AbstractIn this paper we give an O(n2) algorithm to determine fixed bonds and normal subhexagonal sy...
Abstract. Hexagonal systems are geometric objects obtained by arranging mu-tually congruent regular ...
AbstractAn edge of a generalized hexagonal system H is said to be not fixed if it belongs to some bu...
AbstractIn this paper we establish a simple criterion which enables us to determine whether or not a...
AbstractAn edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or...
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...
AbstractA benzenoid system G is k-resonant if any set F of no more than k disjoint hexagons is a res...
AbstractA hexagonal system is a connected plane graph without cut vertices in which each interior fa...
AbstractWe show that for a hypergraph H that is separable and has the Helly property, the perfect ma...
AbstractA hexagonal system is a finite 2-connected plane graph in which every interior face is bound...
Povezava grafa ▫$H$▫, ki premore vsaj eno popolno prirejanje, je fiksna povezava, če bodisi pripada ...
. A simple way to calculate the number of k-matchings, k 5, in hexagonal systems is presented. Some...
The resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, two perf...
AbstractA connected graph G is said to be k-cycle resonant if, for 1 ⩽t⩽k, any t disjoint cycles in ...
AbstractIn this paper we give an O(n2) algorithm to determine fixed bonds and normal subhexagonal sy...
Abstract. Hexagonal systems are geometric objects obtained by arranging mu-tually congruent regular ...
AbstractAn edge of a generalized hexagonal system H is said to be not fixed if it belongs to some bu...
AbstractIn this paper we establish a simple criterion which enables us to determine whether or not a...
AbstractAn edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or...
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...
AbstractA benzenoid system G is k-resonant if any set F of no more than k disjoint hexagons is a res...
AbstractA hexagonal system is a connected plane graph without cut vertices in which each interior fa...
AbstractWe show that for a hypergraph H that is separable and has the Helly property, the perfect ma...
AbstractA hexagonal system is a finite 2-connected plane graph in which every interior face is bound...
Povezava grafa ▫$H$▫, ki premore vsaj eno popolno prirejanje, je fiksna povezava, če bodisi pripada ...
. A simple way to calculate the number of k-matchings, k 5, in hexagonal systems is presented. Some...
The resonance graph R(B) of a benzenoid graph B has the perfect matchings of B as vertices, two perf...
AbstractA connected graph G is said to be k-cycle resonant if, for 1 ⩽t⩽k, any t disjoint cycles in ...
AbstractIn this paper we give an O(n2) algorithm to determine fixed bonds and normal subhexagonal sy...
Abstract. Hexagonal systems are geometric objects obtained by arranging mu-tually congruent regular ...