In this paper we give a fuller exposition of a property of 1-factors discussed in [1]. The 1-factors of cubic graphs are found to be enumerated by a graph-function closley related to the chromatic and flow polynomials. The first part of the paper is a short account, with some minor improvements, of the theory of V-functions and φ-functions first set out in [1]
AbstractThe line graph L(G) of G is that graph whose vertex set corresponds to the edge set of G suc...
AbstractAn algorithm is proposed for the enumeration and display of all 1-factors for a class of gra...
AbstractIn this note, we show how P. Kasteleyn's idea [2] on using Pfaffians to count the 1-factors ...
In this paper we give a fuller exposition of a property of 1-factors discussed in [1]. The 1-factors...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
AbstractA 1-factor M of a cubic graph G is strong if |M∩T|=1 for each 3-edge-cut T of G. It is prove...
One of the most common approaches in studying any polynomial is by looking at its factors. Over the ...
A perfectly one-factorable (P1F) regular graph is a graph admitting a partition of the edge-set into...
Mader [Arch. Math. 23 (1972), 219-224] determined the minimal number of 1-factors in a 2k-connected ...
Mader [Arch. Math. 23 (1972), 219-224] determined the minimal number of 1-factors in a 2k-connected ...
A perfectly one-factorable (P1F) regular graph is a graph admitting a partition of the edge-set into...
A perfectly one-factorable (P1F) regular graph is a graph admitting a partition of the edge-set into...
ABSTRACT. In this paper it is shown that if G is a connected graph of order 2n (n> 1) not contain...
AbstractIt is shown that if H is a connected total graph of order 2n then H has at least 4n − 4 1-fa...
AbstractMader [Arch. Math. 23 (1972), 219–224] determined the minimal number of 1-factors in a 2k-co...
AbstractThe line graph L(G) of G is that graph whose vertex set corresponds to the edge set of G suc...
AbstractAn algorithm is proposed for the enumeration and display of all 1-factors for a class of gra...
AbstractIn this note, we show how P. Kasteleyn's idea [2] on using Pfaffians to count the 1-factors ...
In this paper we give a fuller exposition of a property of 1-factors discussed in [1]. The 1-factors...
AbstractLet G be a graph with a 1-factor F and of order at least four. Let k be a positive integer. ...
AbstractA 1-factor M of a cubic graph G is strong if |M∩T|=1 for each 3-edge-cut T of G. It is prove...
One of the most common approaches in studying any polynomial is by looking at its factors. Over the ...
A perfectly one-factorable (P1F) regular graph is a graph admitting a partition of the edge-set into...
Mader [Arch. Math. 23 (1972), 219-224] determined the minimal number of 1-factors in a 2k-connected ...
Mader [Arch. Math. 23 (1972), 219-224] determined the minimal number of 1-factors in a 2k-connected ...
A perfectly one-factorable (P1F) regular graph is a graph admitting a partition of the edge-set into...
A perfectly one-factorable (P1F) regular graph is a graph admitting a partition of the edge-set into...
ABSTRACT. In this paper it is shown that if G is a connected graph of order 2n (n> 1) not contain...
AbstractIt is shown that if H is a connected total graph of order 2n then H has at least 4n − 4 1-fa...
AbstractMader [Arch. Math. 23 (1972), 219–224] determined the minimal number of 1-factors in a 2k-co...
AbstractThe line graph L(G) of G is that graph whose vertex set corresponds to the edge set of G suc...
AbstractAn algorithm is proposed for the enumeration and display of all 1-factors for a class of gra...
AbstractIn this note, we show how P. Kasteleyn's idea [2] on using Pfaffians to count the 1-factors ...
DOI
Add to ORKG