Premium
The virtual k ‐factorability of graphs
Author(s) -
Negami Seiya
Publication year - 1987
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190110310
Subject(s) - combinatorics , mathematics , bipartite graph , graph , discrete mathematics
It is shown that if a connected graph G admits a finite covering that has a k ‐factor, then there is a 1‐ or 2‐fold covering of G that has a k ‐factor and that such a covering can be given as a canonical bipartite graph associated with G .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom