Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jin, Ligang, Kang, Yingli, Zhu, Xuding
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics 05C10, 05C15
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

$(2,4)$-Colorability of Planar Graphs Excluding $3$-, $4$-, and $6$-Cycles
par: Sittitrai, Pongpat, et autres
Publié: (2025)

Planar graphs with distance of 3-cycles at least 2 and no cycles of lengths 5, 6, 7
par: Wang, Tao, et autres
Publié: (2025)

Planar Graphs with Homomorphisms to the 9-cycle
par: Cranston, Daniel W., et autres
Publié: (2024)

An introduction to equitable DP coloring of graphs
par: Kierstead, H. A., et autres
Publié: (2026)

Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable
par: Kim, Seog-Jin, et autres
Publié: (2025)

Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles
par: Fang, Shu, et autres
Publié: (2026)

B-colorings of planar and outerplanar graphs
par: Martin, Ryan R., et autres
Publié: (2024)

The DP-coloring of the square of subcubic graphs
par: Zhao, Ren
Publié: (2024)

Improper coloring of toroidal graphs
par: Kolačkovská, Alexandra, et autres
Publié: (2025)

Flexible DP 3-coloring of sparse multigraphs
par: Bradshaw, Peter, et autres
Publié: (2025)

DP color functions of hypergraphs
par: Cui, Ruiyi, et autres
Publié: (2025)

Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles
par: Liu, Zhengjiao, et autres
Publié: (2025)

A lower bound on the number of edges in DP-critical graphs. II. Four colors
par: Bradshaw, Peter, et autres
Publié: (2024)

Odd coloring of 2-boundary planar graphs and beyond
par: Liu, Weichan, et autres
Publié: (2022)

The half-monochromatic colorings of plane graphs with even polygonal faces
par: Ichihara, Kazuhiro, et autres
Publié: (2026)

Bounding Clique Size in Squares of Planar Graphs
par: Cranston, Daniel W.
Publié: (2023)

The Heawood approach to Tait colorings and defining vertex sets
par: Lerner, E. Yu.
Publié: (2024)

Hypermaps with hyperedges of length at most $3$
par: Cori, Robert, et autres
Publié: (2026)

5-Coloring Planar Graphs with a Color Class of Order at Most $|V|/6$
par: Inoue, Yuta, et autres
Publié: (2025)

Proper conflict-free degree-choosability of outerplanar graphs
par: Kashima, Masaki, et autres
Publié: (2025)

Three-edge-coloring (Tait coloring) cubic graphs on the torus: A proof of Grünbaum's conjecture
par: Inoue, Yuta, et autres
Publié: (2025)

A note on interval colourings of graphs
par: Axenovich, Maria, et autres
Publié: (2023)

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

On a conjecture about the strong odd chromatic number of planar graphs
par: Manattu, Arun J, et autres
Publié: (2026)

Rainbow planar Tur{á}n numbers of cycles
par: Liu, Xiaonan
Publié: (2025)

A lower bound on the number of edges in DP-critical graphs
par: Bradshaw, Peter, et autres
Publié: (2024)

$5$-list-coloring toroidal $6$-regular triangulations in linear time
par: Balachandran, Niranjan, et autres
Publié: (2021)

Every signed planar graph is $5$-choosable: A short proof and refinements
par: Atangana, Pie Desire Ebode, et autres
Publié: (2026)

Minimal reconstructions of a coloring
par: Gamboa, Diego, et autres
Publié: (2024)

Any 2-coloring of the plane contains monochromatic unit rhombuses
par: Moore, Kenneth, et autres
Publié: (2026)

Planar 1-ended graphs can be periodically coloured
par: Waite, Luke
Publié: (2026)

Hyperoctahedral group characters and a type-BC analog of graph coloring
par: Skandera, Mark
Publié: (2024)

Three-edge-coloring projective planar cubic graphs: A generalization of the Four Color Theorem
par: Inoue, Yuta, et autres
Publié: (2024)

Minimal obstructions to $C_5$-coloring in hereditary graph classes
par: Goedgebeur, Jan, et autres
Publié: (2024)

On the 3-colorability of triangle-free and fork-free graphs
par: Schroeder, Joshua, et autres
Publié: (2021)

Colouring negative exact-distance graphs of signed graphs
par: Naserasr, Reza, et autres
Publié: (2024)

Counting subgraphs of coloring graphs
par: Asgarli, Shamil, et autres
Publié: (2024)

Strong majority colorings of graphs
par: Kalinowski, Rafał, et autres
Publié: (2026)

Injective coloring of product graphs
par: Samadi, Babak, et autres
Publié: (2023)

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