# Partial parity (g, f)-factors and subgraphs covering given vertex subsets

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

## Abstract

Let G be a graph and W a subset of V(G). Let g, f : V(G) → Z be two integer-valued functions such that g(x) ≤ f(x) for all x ∈ V(G) and g(y) = f(y) (mod 2) for all y ∈ W. Then a spanning subgraph F of G is called a partial parity (g, f)-factor with respect to W if g(x) ≤ degF(x) ≤ f(x) for all x ∈ V(G) and degF(y) ≡ f(y) (mod 2) for all y ∈ W. We obtain a criterion for a graph G to have a partial parity (g, f)-factor with respect to W. Furthermore, by making use of this criterion, we give some necessary and sufficient conditions for a graph G to have a subgraph which covers W and has a certain given property.

Original language English 501-509 9 Graphs and Combinatorics 17 3 https://doi.org/10.1007/PL00013412 Published - 2001 Yes

## ASJC Scopus subject areas

• Theoretical Computer Science
• Discrete Mathematics and Combinatorics

## Fingerprint

Dive into the research topics of 'Partial parity (g, f)-factors and subgraphs covering given vertex subsets'. Together they form a unique fingerprint.