3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles
Abstract
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
Information & Authors
Information
Published In

Copyright
History
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- Planar graphs without normally adjacent short cyclesDiscrete Mathematics, Vol. 345, No. 10 | 1 Oct 2022
- DP-3-coloring of planar graphs without certain cyclesDiscrete Applied Mathematics, Vol. 297 | 1 Jul 2021
- Facial unique-maximum colorings of plane graphs with restriction on big verticesDiscrete Mathematics, Vol. 342, No. 9 | 1 Sep 2019
- Facial Colorings of Plane GraphsJournal of Interconnection Networks, Vol. 19, No. 01 | 28 April 2019
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge CountGraph Drawing and Network Visualization | 21 January 2018
- List Colouring and Partial List Colouring of Graphs On-lineCombinatorial Algorithms | 20 February 2016
- On Coloring ProblemsHandbook of Combinatorial Optimization | 26 July 2013
- ON-LINE 3-CHOOSABLE PLANAR GRAPHSTaiwanese Journal of Mathematics, Vol. 16, No. 2 | 1 Mar 2012
- 3-list-coloring planar graphs of girth 4Discrete Mathematics, Vol. 311, No. 6 | 1 Mar 2011
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].