z-logo
Premium
Regular factors of regular graphs
Author(s) -
Bollobás B.,
Saito Akira,
Wormald N. C.
Publication year - 1985
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.3190090107
Subject(s) - mathematics , combinatorics , strongly regular graph , graph , enhanced data rates for gsm evolution , discrete mathematics , line graph , pathwidth , computer science , telecommunications
Given r ⩾ 3 and 1 ⩽ λ ⩽ r , we determine all values of k for which every r ‐regular graph with edge‐connectivity λ has a k ‐factor.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom