A Tutte-type characterization for graph factors

Hongliang Lu, David G.L. Wang*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)
Plum Print visual indicator of research metrics
  • Citations
    • Citation Indexes: 4
  • Captures
    • Readers: 9
see details

Abstract

Let G be a connected general graph. For any vertex v ∈ V (G) and any function f : V(G) → Z+, we introduce a set J∗f (v) consisting of the integer f(v) and all odd integers less than f(v), including all negative odd integers. In this paper, we shows that the graph G satisfies the general Tutte-type condition o(G - S) ≤ ∑v∈S f(v) for any nonempty set S ⊃ V (G) if and only if either G has a colored J∗f-factor for any 2-end-coloring, or G is of odd order and is J∗f-critical for any 2-end-coloring. This characterization solves a problem posed by Akiyama and Kano, as well as a problem of Cui and Kano's.

Original languageEnglish
Pages (from-to)1149-1159
Number of pages11
JournalSIAM Journal on Discrete Mathematics
Volume31
Issue number2
DOIs
Publication statusPublished - 2017

Keywords

  • Antifactor
  • Degree prescribed subgraph problem
  • Graph factor
  • Perfect matching

Fingerprint

Dive into the research topics of 'A Tutte-type characterization for graph factors'. Together they form a unique fingerprint.

Cite this

Lu, H., & Wang, D. G. L. (2017). A Tutte-type characterization for graph factors. SIAM Journal on Discrete Mathematics, 31(2), 1149-1159. https://doi.org/10.1137/16M1079609