Cover Image

Every connected subcubic graph except the Petersen graph is packing $(1,1,2,2)$-colorable

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hou, Xinmin, Liu, Xujun, Wang, Xiangyang
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Every subcubic graph is packing $(1,1,2,2,3)$-colorable
by: Liu, Xujun, et al.
Published: (2024)

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

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

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

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

Divisible subdivisions of graphs in subdivisions of complete graphs
by: Hou, Xinmin, et al.
Published: (2025)

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

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

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

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

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

On $\{1,2\}$-distance-balancedness of generalized Petersen graphs
by: Ma, Gang, et al.
Published: (2024)

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

Monochromatic triangle-tilings in dense graphs without large independent sets
by: Hou, Xinmin, et al.
Published: (2026)

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

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

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

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

Generalized Petersen graphs are (1,3)-choosable
by: Tang, Yunfang, et al.
Published: (2024)

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

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

Edge-coloring 4- and 5-regular projective planar graphs with no Petersen-minor
by: Kidner, Arnott, et al.
Published: (2025)

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

Dirac-type condition for Hamilton-generated graphs
by: Hou, Xinmin, et al.
Published: (2025)

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

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

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

Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph
by: Wang, Yichen, et al.
Published: (2024)

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

Classification of perfect and total perfect codes in generalized Petersen graphs
by: Wang, Xiaomeng, et al.
Published: (2026)

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

Every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian
by: Shao, Sihong, et al.
Published: (2025)

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

Decomposable polymatroids and connections with graph coloring
by: Bonin, Joseph E., et al.
Published: (2019)

Counting triangles in regular graphs
by: He, Jialin, et al.
Published: (2023)

A Short Proof that Every Claw-Free Cubic Graph is (1,1,2,2)-Packing Colorable
by: Mortada, Maidoun, et al.
Published: (2025)

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

Induced subgraphs of graphs with large deficiency
by: Sun, Jin, et al.
Published: (2025)

The $K_{1,2}$-structure-connectivity of graphs
by: Zhao, Xiao, et al.
Published: (2024)

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