Advertisement

Component Factors

  • Jin AkiyamaEmail author
  • Mikio Kano
Chapter
  • 1.1k Downloads
Part of the Lecture Notes in Mathematics book series (LNM, volume 2031)

Abstract

In this chapter we investigate a component factor, which is a spanning subgraph having specified components. For example, a K2-factor, each of whose components is the complete graph K2, is the same as a 1-factor. For a family S of connected graphs, a subgraph H of a graph G is called an S-subgraph if each component of H is isomorphic to an element of S, and a spanning S-subgraph is called an S-factor. If S consists of exactly one graph K, then a {K}-factor is often called a K-factor.

Keywords

Bipartite Graph Simple Graph Component Factor Factor Theorem Span Subgraph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  1. 1.Research Institute of Educational DevelopmentTokai UniversityTokyoJapan
  2. 2.Computer and Information SciencesIbaraki UniversityHitachiJapan

Personalised recommendations