Showing 1–17 of 17 results
/ Date/ Name
Apr 11, 2018Every planar graph without adjacent cycles of length at most $8$ is $3$-choosableAug 27, 2022Spanning tree packing and 2-essential edge-connectivityApr 21, 2018Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorableOct 20, 2025List-recoloring of two classes of planar graphsJul 15, 2019Planar graphs without 7-cycles and butterflies are DP-4-colorableSep 14, 2014Planar graphs without 5-cycles and intersecting triangles are $(1,1,0)$-colorableJun 28, 20221-planar graphs are odd 13-colorableFeb 26, 2018DP-3-coloring of some planar graphsJul 19, 2014A relaxation of the Bordeaux ConjectureJun 20, 2018Planar graphs without 4-cycles and close triangles are (2,0,0)-colorableNov 7, 2018DP-4-colorability of two classes of planar graphsNov 10, 2019Packing $(1,1,2,2)$-coloring of some subcubic graphsJun 21, 2019Fat-triangle linkage and kite-linked graphsNov 19, 2018Minimum degree condition for a graph to be knittedSep 20, 2018DP-3-coloring of planar graphs without $4,9$-cycles and two cycles from $\{5,6,7,8\}$Jun 1, 2021Planar graphs without short even cycles are near-bipartiteSep 8, 2025Connectivity of contraction-critical graphs