A note on the cover degeneracy of graphs
✍
Li Zhang; Baoyindureng Wu
📂
Article
📅
2005
🏛
John Wiley and Sons
🌐
English
⚖ 64 KB
👁 1 views
## Abstract We give a 4‐chromatic planar graph, which admits a vertex partition into three parts such that the union of every two of them induces a forest. This solves a problem posed by Böhme. Also, by constructing an infinite sequence of graphs, we show that the cover degeneracy can be arbitraril