Cover Image

Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jin, Ligang, Kang, Yingli, Zhu, Xuding
Format:	Preprint
Published:	2024
Subjects:	Combinatorics 05C10, 05C15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

$(2,4)$-Colorability of Planar Graphs Excluding $3$-, $4$-, and $6$-Cycles
by: Sittitrai, Pongpat, et al.
Published: (2025)

Planar graphs with distance of 3-cycles at least 2 and no cycles of lengths 5, 6, 7
by: Wang, Tao, et al.
Published: (2025)

Planar Graphs with Homomorphisms to the 9-cycle
by: Cranston, Daniel W., et al.
Published: (2024)

An introduction to equitable DP coloring of graphs
by: Kierstead, H. A., et al.
Published: (2026)

Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable
by: Kim, Seog-Jin, et al.
Published: (2025)

Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles
by: Fang, Shu, et al.
Published: (2026)

B-colorings of planar and outerplanar graphs
by: Martin, Ryan R., et al.
Published: (2024)

The DP-coloring of the square of subcubic graphs
by: Zhao, Ren
Published: (2024)

Improper coloring of toroidal graphs
by: Kolačkovská, Alexandra, et al.
Published: (2025)

Flexible DP 3-coloring of sparse multigraphs
by: Bradshaw, Peter, et al.
Published: (2025)

DP color functions of hypergraphs
by: Cui, Ruiyi, et al.
Published: (2025)

Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles
by: Liu, Zhengjiao, et al.
Published: (2025)

A lower bound on the number of edges in DP-critical graphs. II. Four colors
by: Bradshaw, Peter, et al.
Published: (2024)

Odd coloring of 2-boundary planar graphs and beyond
by: Liu, Weichan, et al.
Published: (2022)

The half-monochromatic colorings of plane graphs with even polygonal faces
by: Ichihara, Kazuhiro, et al.
Published: (2026)

Bounding Clique Size in Squares of Planar Graphs
by: Cranston, Daniel W.
Published: (2023)

The Heawood approach to Tait colorings and defining vertex sets
by: Lerner, E. Yu.
Published: (2024)

Hypermaps with hyperedges of length at most $3$
by: Cori, Robert, et al.
Published: (2026)

5-Coloring Planar Graphs with a Color Class of Order at Most $|V|/6$
by: Inoue, Yuta, et al.
Published: (2025)

Proper conflict-free degree-choosability of outerplanar graphs
by: Kashima, Masaki, et al.
Published: (2025)

Three-edge-coloring (Tait coloring) cubic graphs on the torus: A proof of Grünbaum's conjecture
by: Inoue, Yuta, et al.
Published: (2025)

A note on interval colourings of graphs
by: Axenovich, Maria, et al.
Published: (2023)

An improved bound for 2-distance coloring of planar graphs with girth six
by: Deniz, Zakir
Published: (2022)

On a conjecture about the strong odd chromatic number of planar graphs
by: Manattu, Arun J, et al.
Published: (2026)

Rainbow planar Tur{á}n numbers of cycles
by: Liu, Xiaonan
Published: (2025)

A lower bound on the number of edges in DP-critical graphs
by: Bradshaw, Peter, et al.
Published: (2024)

$5$-list-coloring toroidal $6$-regular triangulations in linear time
by: Balachandran, Niranjan, et al.
Published: (2021)

Every signed planar graph is $5$-choosable: A short proof and refinements
by: Atangana, Pie Desire Ebode, et al.
Published: (2026)

Minimal reconstructions of a coloring
by: Gamboa, Diego, et al.
Published: (2024)

Any 2-coloring of the plane contains monochromatic unit rhombuses
by: Moore, Kenneth, et al.
Published: (2026)

Planar 1-ended graphs can be periodically coloured
by: Waite, Luke
Published: (2026)

Hyperoctahedral group characters and a type-BC analog of graph coloring
by: Skandera, Mark
Published: (2024)

Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
by: Inoue, Yuta, et al.
Published: (2024)

Minimal obstructions to $C_5$-coloring in hereditary graph classes
by: Goedgebeur, Jan, et al.
Published: (2024)

On the 3-colorability of triangle-free and fork-free graphs
by: Schroeder, Joshua, et al.
Published: (2021)

Colouring negative exact-distance graphs of signed graphs
by: Naserasr, Reza, et al.
Published: (2024)

Counting subgraphs of coloring graphs
by: Asgarli, Shamil, et al.
Published: (2024)

Strong majority colorings of graphs
by: Kalinowski, Rafał, et al.
Published: (2026)

Injective coloring of product graphs
by: Samadi, Babak, et al.
Published: (2023)

An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
by: Mkrtchyan, Vahan
Published: (2024)