3‐Coloring Triangle‐Free Planar Graphs with a Precolored 8‐Cycle

Thumbnail Image
Supplemental Files
Date
2015-10-01
Authors
dvořák, zdeněk
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
Abstract

Let G be a planar triangle-free graph and let C be a cycle in G of length at most 8. We characterize all situations where a 3-coloring of C does not extend to a proper 3-coloring of the whole graph.

Comments

This is the peer-reviewed version of the following article: dvořák, zdeněk and Bernard Lidický. "3‐Coloring Triangle‐Free Planar Graphs with a Precolored 8‐Cycle." Journal of Graph Theory 80, no. 2 (2015): 98-111, which has been published in final form at doi: 10.1002/jgt.21842. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving. Posted with permission.

Description
Keywords
Citation
DOI
Copyright
Wed Jan 01 00:00:00 UTC 2014
Collections