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

Research output: Contribution to journalArticle

2 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 languageEnglish
Pages (from-to)501-509
Number of pages9
JournalGraphs and Combinatorics
Volume17
Issue number3
Publication statusPublished - 2001
Externally publishedYes

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics

Cite this

Partial parity (g, f)-factors and subgraphs covering given vertex subsets. / Kano, M.; Matsuda, Haruhide.

In: Graphs and Combinatorics, Vol. 17, No. 3, 2001, p. 501-509.

Research output: Contribution to journalArticle

@article{0ac1186c23b74deabc1efc45d8c1914f,
title = "Partial parity (g, f)-factors and subgraphs covering given vertex subsets",
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.",
author = "M. Kano and Haruhide Matsuda",
year = "2001",
language = "English",
volume = "17",
pages = "501--509",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "3",

}

TY - JOUR

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

AU - Kano, M.

AU - Matsuda, Haruhide

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=19544374330&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=19544374330&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:19544374330

VL - 17

SP - 501

EP - 509

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 3

ER -