5-choosability of graphs with crossings far apart
Date
2017-03-01
Authors
Major Professor
Advisor
Committee Member
Journal Title
Journal ISSN
Volume Title
Publisher
Authors
Person
Lidicky, Bernard
Professor
Research Projects
Organizational Units
Organizational Unit
Mathematics
Welcome to the exciting world of mathematics at Iowa State University.
From cracking codes to modeling the spread of diseases, our program offers something for everyone. With a wide range of courses and research opportunities, you will have the chance to delve deep into the world of mathematics and discover your own unique talents and interests. Whether you dream of working for a top tech company, teaching at a prestigious university, or pursuing cutting-edge research, join us and discover the limitless potential of mathematics at Iowa State University!
Journal Issue
Is Version Of
Versions
Series
Department
Mathematics
Abstract
We give a new proof of the fact that every planar graph is 5-choosable, and use it to show that every graph drawn in the plane so that the distance between every pair of crossings is at least 15 is 5-choosable. At the same time we may allow some vertices to have lists of size four only, as long as they are far apart and far from the crossings.
Comments
This is a manuscript of an article published as Dvořák, Zdeněk, Bernard Lidický, and Bojan Mohar. "5-choosability of graphs with crossings far apart." Journal of Combinatorial Theory, Series B 123 (2017): 54-96. doi: 10.1016/j.jctb.2016.11.004. Posted with permission.
Description
Keywords
Citation
DOI
Subject Categories
Copyright
Fri Jan 01 00:00:00 UTC 2016