Premium
A note concerning graphs with unique f‐factors
Author(s) -
Jackson Bill,
Whitty R. W.
Publication year - 1989
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.3190130507
Subject(s) - combinatorics , mathematics , vertex (graph theory) , graph , enhanced data rates for gsm evolution , discrete mathematics , computer science , artificial intelligence
We show that if a 2‐edge connected graph G has a unique f ‐factor F , then some vertex has the same degree in F as in G . This conclusion is the best possible, even if the hypothesis is considerably strengthened.