Vertex-disjoint cycles containing specified vertices in a bipartite graph

Guantao Chen, Hikoe Enomoto, Ken Ichi Kawarabayashi, Katsuhiro Ota, Dingjun Lou, Akira Saito

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

A minimum degree condition is given for a bipartite graph to contain a 2-factor each component of which contains a previously specified Vertex.

Original languageEnglish
Pages (from-to)145-166
Number of pages22
JournalJournal of Graph Theory
Volume46
Issue number3
DOIs
Publication statusPublished - 2004 Jul

Keywords

  • 2-factor
  • Bipartite graph
  • Minimum degree

ASJC Scopus subject areas

  • Geometry and Topology

Fingerprint Dive into the research topics of 'Vertex-disjoint cycles containing specified vertices in a bipartite graph'. Together they form a unique fingerprint.

  • Cite this

    Chen, G., Enomoto, H., Kawarabayashi, K. I., Ota, K., Lou, D., & Saito, A. (2004). Vertex-disjoint cycles containing specified vertices in a bipartite graph. Journal of Graph Theory, 46(3), 145-166. https://doi.org/10.1002/jgt.10159