AbstractIf a graph G is decomposed into m 2-factors, then an orthogonal matching is a matching M in G which contains exactly one edge from each 2-factor. It has been conjectured that any 2-factorization of any graph has an orthogonal matching. We prove this conjecture under the additional assumption that G has at least 3m−2 vertices
AbstractOn the basis of the observation that a 3-regular graph has a perfect matching if and only if...
An H-decomposition of a graph G is a partition of the edge-set of G into subsets, where each subset ...
It is a well-known conjecture that if a regular graph G of order 2n has degree d(G) satisfying d(G) ...
AbstractA 2-factorization of a 2d-regular graph G has an orthogonal matching if there is a matching ...
AbstractConsider a graph G which is a union of m spanning subgraphs regular of degree k. We show tha...
AbstractLet G be a graph and let F = F1, F2, …, Fm and H be a factorization and a subgraph of G, res...
AbstractLet F and G be two graphs and let H be a subgraph of G. A decomposition of G into subgraphs ...
AbstractLet G=(V,E) be a graph and let g and f be two integer-valued functions defined on V such tha...
For a family of connected graphs $ \mathcal{A}$, a spanning subgraph H of a graph G is called an $ \...
Given a simple bipartite graph G=(X,Y, E). M {Mathematical expression}E is called a 2-1 matching of ...
A matching in a graph is a set of pairwise nonadjacent edges, a k-factor is a k-regular spanning sub...
In this thesis, three generalizations of the matching problem are considered. The first problem is ...
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property...
AbstractAn H-decomposition of a graph G is a partition of the edge-set of G into subsets, where each...
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number o
AbstractOn the basis of the observation that a 3-regular graph has a perfect matching if and only if...
An H-decomposition of a graph G is a partition of the edge-set of G into subsets, where each subset ...
It is a well-known conjecture that if a regular graph G of order 2n has degree d(G) satisfying d(G) ...
AbstractA 2-factorization of a 2d-regular graph G has an orthogonal matching if there is a matching ...
AbstractConsider a graph G which is a union of m spanning subgraphs regular of degree k. We show tha...
AbstractLet G be a graph and let F = F1, F2, …, Fm and H be a factorization and a subgraph of G, res...
AbstractLet F and G be two graphs and let H be a subgraph of G. A decomposition of G into subgraphs ...
AbstractLet G=(V,E) be a graph and let g and f be two integer-valued functions defined on V such tha...
For a family of connected graphs $ \mathcal{A}$, a spanning subgraph H of a graph G is called an $ \...
Given a simple bipartite graph G=(X,Y, E). M {Mathematical expression}E is called a 2-1 matching of ...
A matching in a graph is a set of pairwise nonadjacent edges, a k-factor is a k-regular spanning sub...
In this thesis, three generalizations of the matching problem are considered. The first problem is ...
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property...
AbstractAn H-decomposition of a graph G is a partition of the edge-set of G into subsets, where each...
Upper bounds on the number of perfect matchings and directed 2-factors in graphs with given number o
AbstractOn the basis of the observation that a 3-regular graph has a perfect matching if and only if...
An H-decomposition of a graph G is a partition of the edge-set of G into subsets, where each subset ...
It is a well-known conjecture that if a regular graph G of order 2n has degree d(G) satisfying d(G) ...
DOI
Add to ORKG