Add to ORKGLet be a graph. If there exists a spanning subgraph G F such that 1,3, , 2 1Fd x n , then F is called to be-odd factor of. Some sufficient and necessary conditions are given for to have n 1,2 1 G G U – 1,2 1n -odd factor where is any subset of such that U V G U k
Let G be a connected graph of even order n. An odd [1, b]-factor of G is a spanning subgraph F of G ...
For a graph G, a spanning subgraph F of G is called an {P2, P5}-factor if every component of F is is...
For a graph G, a spanning subgraph F of G is called an {P2, P5}-factor if every component of F is is...
Let G be a graph and f: V (G) → {1, 3, 5,...}. Then a span-ning subgraph F of G is called a (1, f)-o...
Let G be a simple graph and f: V (G) 7 → {1, 3, 5,...} an odd integer valued function defined on V (...
This note concerns the (1, f)-odd subgraph problem, i.e. we are given an undirected graph G and an o...
Let odd(G) denote the number of odd components of a graph G and k ≥ 2 be an integer. We give suffici...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
AbstractLet G be a graph and f:V(G)→{1,3,5,…}. Then a subgraph H of G is called a (1,f)-odd subgraph...
vertex set and the edge set of G, respectively. The number |V(G) | is called the order of G. If W £ ...
A one-factor of a graph G is a I-regular spanning subgraph of G. For given positive integers and eve...
A one-factor of a graph G is a I-regular spanning subgraph of G. For given positive integers and eve...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
AbstractWe present some conditions for the existence of a (g,f)-factor or a (g,f)-parity factor in a...
Let G be a connected graph of even order n. An odd [1, b]-factor of G is a spanning subgraph F of G ...
Let G be a connected graph of even order n. An odd [1, b]-factor of G is a spanning subgraph F of G ...
For a graph G, a spanning subgraph F of G is called an {P2, P5}-factor if every component of F is is...
For a graph G, a spanning subgraph F of G is called an {P2, P5}-factor if every component of F is is...
Let G be a graph and f: V (G) → {1, 3, 5,...}. Then a span-ning subgraph F of G is called a (1, f)-o...
Let G be a simple graph and f: V (G) 7 → {1, 3, 5,...} an odd integer valued function defined on V (...
This note concerns the (1, f)-odd subgraph problem, i.e. we are given an undirected graph G and an o...
Let odd(G) denote the number of odd components of a graph G and k ≥ 2 be an integer. We give suffici...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
AbstractLet G be a graph and f:V(G)→{1,3,5,…}. Then a subgraph H of G is called a (1,f)-odd subgraph...
vertex set and the edge set of G, respectively. The number |V(G) | is called the order of G. If W £ ...
A one-factor of a graph G is a I-regular spanning subgraph of G. For given positive integers and eve...
A one-factor of a graph G is a I-regular spanning subgraph of G. For given positive integers and eve...
AbstractA spanning subgraph F of a graph G is called a [k − 1, k]-factor if k − 1 ≤ df(x) ≤ k for al...
AbstractWe present some conditions for the existence of a (g,f)-factor or a (g,f)-parity factor in a...
Let G be a connected graph of even order n. An odd [1, b]-factor of G is a spanning subgraph F of G ...
Let G be a connected graph of even order n. An odd [1, b]-factor of G is a spanning subgraph F of G ...
For a graph G, a spanning subgraph F of G is called an {P2, P5}-factor if every component of F is is...
For a graph G, a spanning subgraph F of G is called an {P2, P5}-factor if every component of F is is...