Planar Graphs without 7-Cycles Are 4-Choosable

Babak Farzad

SIAM Journal on Discrete Mathematics · 2009 · 36 citations · 9 references

Concepts

Abstract

In this paper, we show that every planar graph without 7-cycles is 4-choosable.MSC codes05C1505C10Keywordsplanar graphscoloringchoosability

References

9