On<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si7.gif" display="inline" overflow="scroll"><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mo>∗</mml:mo></mml:mrow></mml:msup></mml:math>-choosability of planar graphs without adjacent short cycles

Discrete Applied Mathematics - Tập 162 - Trang 159-166 - 2014
Min Chen1, André Raspaud2
1Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China
2LaBRI UMR CNRS 5800, Université Bordeaux I, 33405 Talence Cedex, France

Tài liệu tham khảo