Planar graphs without 7-cycles and butterflies are DP-4-colorable
- 1 August 2020
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 343 (8)
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Research Foundation of Korea
This publication has 14 references indexed in Scilit:
- DP-4-colorability of two classes of planar graphsDiscrete Mathematics, 2019
- Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-ColorableGraphs and Combinatorics, 2019
- Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorableDiscrete Mathematics, 2019
- A sufficient condition for DP-4-colorabilityDiscrete Mathematics, 2018
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8Journal of Combinatorial Theory, Series B, 2018
- Colorings of plane graphs: A surveyDiscrete Mathematics, 2013
- Planar Graphs without 7-Cycles Are 4-ChoosableSIAM Journal on Discrete Mathematics, 2009
- Planar Graphs Without Cycles of Specific LengthsEuropean Journal of Combinatorics, 2002
- On Structure of Some Plane Graphs with Application to ChoosabilityJournal of Combinatorial Theory, Series B, 2001
- The 4-Choosability of Plane Graphs without 4-CyclesJournal of Combinatorial Theory, Series B, 1999