Premium
Defective choosability of graphs with no edge‐plus‐independent‐set minor
Author(s) -
Woodall Douglas R.
Publication year - 2004
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.10153
Subject(s) - combinatorics , mathematics , minor (academic) , graph , graph minor , discrete mathematics , line graph , voltage graph , humanities , art
It is proved that, if s ≥ 2, a graph that does not have K 2 + K s = K 1 + K 1, s as a minor is ( s , 1)*‐choosable. This completes the proof that such a graph is ( s + 1 − d , d )*‐choosable whenever 0 ≤ d ≤ s −1 © 2003 Wiley Periodicals, Inc. J Graph Theory 45: 51–56, 2004
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