Imagen de Portada

Every subcubic graph is packing $(1,1,2,2,3)$-colorable

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Liu, Xujun, Zhang, Xin, Zhang, Yanting
Formato:	Preprint
Publicado:	2024
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Every connected subcubic graph except the Petersen graph is packing $(1,1,2,2)$-colorable
por: Hou, Xinmin, et al.
Publicado: (2026)

On $(1^2,2^2)$-packing edge-coloring of sparse subcubic graphs
por: Liu, Xujun, et al.
Publicado: (2026)

On the $(1^2,2^4)$-packing edge-coloring of subcubic graphs
por: Liu, Xujun, et al.
Publicado: (2024)

Packing edge-colorings of subcubic outerplanar graphs
por: Li, Sijin, et al.
Publicado: (2024)

Partition subcubic planar graphs into independent sets
por: Liu, Xujun, et al.
Publicado: (2024)

Impact of local girth on the S-packing coloring of k-saturated subcubic graphs
por: Zein, Ayman El, et al.
Publicado: (2026)

On independent domination and packing numbers of subcubic graphs
por: Bai, Xuqing, et al.
Publicado: (2024)

Between proper and square colorings of planar graphs with maximum degree at most four
por: Liu, Xujun, et al.
Publicado: (2026)

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

Between proper and square colorings of sparse graphs
por: Choi, Ilkyoo, et al.
Publicado: (2025)

11/4-colorability of subcubic triangle-free graphs
por: Dvořák, Zdeněk, et al.
Publicado: (2022)

Fast algorithm for $S$-packing coloring of Halin graphs
por: Zhang, Xin, et al.
Publicado: (2025)

2-distance 4-coloring of planar subcubic graphs with girth at least 21
por: La, Hoang, et al.
Publicado: (2021)

The $n/2$-bound for locating-dominating sets in subcubic graphs
por: Chakraborty, Dipayan, et al.
Publicado: (2024)

Frustration indices of signed subcubic graphs
por: Chen, Sirui, et al.
Publicado: (2025)

Claw-free cubic graphs are (1, 1, 1, 3)-packing edge-colorable
por: Hou, Jingxi, et al.
Publicado: (2025)

Fractional balanced chromatic number of signed subcubic graphs
por: Hu, Xiaolan, et al.
Publicado: (2025)

Every graph with no $K_7^{\vee}$-minor is $6$-colorable
por: Norin, Sergey, et al.
Publicado: (2025)

Coalition graphs of connected domination partitions in subcubic graphs
por: Dobrynin, Andrey A., et al.
Publicado: (2025)

Median eigenvalues of subcubic graphs
por: Acharya, Hricha, et al.
Publicado: (2025)

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

Strong list-chromatic index of subcubic graphs is at most 10
por: Tang, Yunfang, et al.
Publicado: (2025)

Equitable coloring of sparse graphs
por: Liu, Weichan, et al.
Publicado: (2024)

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

On packing total coloring
por: Ferme, Jasmina, et al.
Publicado: (2025)

Covering and 2-degree-packing numbers in graphs
por: Montufar, Carlos Alfaro, et al.
Publicado: (2017)

Maximizing the spectral radius of graphs of given size with forbidden a subgraph
por: Zhang, Yanting, et al.
Publicado: (2024)

Every graph is uniform-span $(2,2)$-choosable: Beyond the 1-2 conjecture
por: Deng, Kecai, et al.
Publicado: (2025)

Cooperative coloring of some graph families
por: Bai, Xuqing, et al.
Publicado: (2023)

Every $3$-connected $\{K_{1,3},Γ_3\}$-free graph is Hamilton-connected
por: Kabela, Adam, et al.
Publicado: (2024)

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

The square of every subcubic planar graph without 4-cycles and 5-cycles is 7-choosable
por: Jin, Ligang, et al.
Publicado: (2025)

Triangle packings in randomly perturbed graphs
por: Cheng, Xinbu, et al.
Publicado: (2026)

Solution to a $3$-path isolation problem for subcubic graphs
por: Bartolo, Karl, et al.
Publicado: (2024)

Latin cubes with disjoint subcubes of two orders
por: Kemp, Tara, et al.
Publicado: (2025)

Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree
por: Zhang, Yiran, et al.
Publicado: (2023)

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

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

$C_{2k+1}$-coloring of bounded-diameter graphs
por: Piecyk, Marta
Publicado: (2024)

Clique packings in random graphs
por: Griffiths, Simon, et al.
Publicado: (2024)