On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability
From MaRDI portal
Publication:1598834
DOI10.1016/S0012-365X(01)00351-XzbMath1054.05033MaRDI QIDQ1598834
Publication date: 28 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (3)
Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable ⋮ On 3-choosability of plane graphs without 6-, 7- and 9-cycles ⋮ A structural theorem on embedded graphs and its application to colorings
This page was built for publication: On structure of graphs embedded on surfaces of nonnegative characteristic with application to choosability
