Cover Image

The DP-coloring of the square of subcubic graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Zhao, Ren
Format:	Preprint
Published:	2024
Subjects:	Combinatorics 05C15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The square of a subcubic planar graph without a 5-cycle is 7-choosable
by: Kim, Seog-Jin, et al.
Published: (2025)

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

Median eigenvalues of subcubic graphs
by: Acharya, Hricha, et al.
Published: (2025)

Planar graphs having no cycle of length $4$, $6$ or $8$ are DP-3-colorable
by: Jin, Ligang, et al.
Published: (2024)

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

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

Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable
by: Kim, Seog-Jin, 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)

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

A lower bound on the number of edges in DP-critical graphs
by: Bradshaw, Peter, 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)

On the interval coloring impropriety of graphs
by: Carr, MacKenzie, et al.
Published: (2023)

On odd colorings of sparse graphs
by: Wang, Tao, et al.
Published: (2022)

Equitable list coloring of sparse graphs
by: Kierstead, H. A., et al.
Published: (2024)

Strong parity edge-colorings of graphs
by: Bradshaw, Peter, et al.
Published: (2024)

Strong odd coloring of sparse graphs
by: Kwon, Hyemin, et al.
Published: (2024)

Reconfiguration graphs for vertex colorings of $P_5$-free graphs
by: Lei, Hui, et al.
Published: (2024)

Injective (edge) colorings of generalized Sierpiński graphs
by: Bhanupriya, C. K., et al.
Published: (2025)

Star edge coloring of generalized Petersen graphs
by: Dastjerdi, Behnaz Omoomi Marzieh Vahid
Published: (2024)

Total coloring graphs with large maximum degree
by: Dalal, Aseem, et al.
Published: (2024)

Total coloring graphs with large minimum degree
by: Henderschedt, Owen, et al.
Published: (2025)

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

Injective colorings of Sierpiński-like graphs and Kneser graphs
by: Brešar, Boštjan, et al.
Published: (2024)

On the independence number in subcubic graphs
by: Harant, Jochen, et al.
Published: (2025)

Interval edge-colorings of Cartesian products of graphs II
by: Petrosyan, Petros A., et al.
Published: (2024)

Results on proper conflict-free list coloring of graphs
by: Kashima, Masaki, et al.
Published: (2025)

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

Trivial coloring of Cartesian product of graphs
by: Csernák, Tamás
Published: (2023)

DP-colorings of uniform hypergraphs and splittings of Boolean hypercube into faces
by: Potapov, Vladimir N.
Published: (2019)

Genetic algorithm and edge-colorings of complete graphs with connected classes
by: Cervantes-Ojeda, Jorge, et al.
Published: (2024)

$S$-packing colorings of distance graphs with distance sets of cardinality $2$
by: Brešar, Boštjan, et al.
Published: (2024)

Reconfiguration graph for vertex colorings for ($P_2$+$P_3$, $C_4$)-free graphs
by: Belavadi, M., et al.
Published: (2025)

Strong edge-coloring of graphs with maximum edge weight seven
by: Wang, Runze
Published: (2025)

On a conjecture concerning 4-coloring of graphs with one crossing
by: Dvořák, Zdeněk, et al.
Published: (2025)

Normal 6-edge-colorings of cubic graphs with oddness 2
by: Fabrici, Igor, et al.
Published: (2025)

On Polynomial Representations of Dual DP Color Functions
by: Mudrock, Jeffrey A., et al.
Published: (2024)

A Note on Fractional DP-Coloring of Graphs
by: Dominik, Daniel, et al.
Published: (2019)

Claw-free cubic graphs are $(1, 1, 2, 2)$-colorable
by: Brešar, Boštjan, et al.
Published: (2024)

Banff designs: difference methods for coloring incidence graphs
by: Buratti, Marco, et al.
Published: (2023)