z-logo
open-access-imgOpen Access
Even [a,b]-factors in graphs
Author(s) -
Mekkia Kouider,
Preben Dahl Vestergaard
Publication year - 2004
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1242
Subject(s) - mathematics , combinatorics
Let a and b be integers 4 ≤ a ≤ b. We give simple, sufficient conditions for graphs to contain an even [a, b]-factor. The conditions are on the order and on the minimum degree, or on the edge-connectivity of the graph. Mathematics Subject Classification: 05C70

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

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