On $(1^2,2^2)$-packing edge-coloring of sparse subcubic graphs
Fuente:
arXiv
Saved in:
| Main Authors: | Liu, Xujun, Yang, Jiacheng, Zhang, Xin |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
On the $(1^2,2^4)$-packing edge-coloring of subcubic graphs
by: Liu, Xujun, et al.
Published: (2024)
by: Liu, Xujun, et al.
Published: (2024)
Every subcubic graph is packing $(1,1,2,2,3)$-colorable
by: Liu, Xujun, et al.
Published: (2024)
by: Liu, Xujun, et al.
Published: (2024)
Every connected subcubic graph except the Petersen graph is packing $(1,1,2,2)$-colorable
by: Hou, Xinmin, et al.
Published: (2026)
by: Hou, Xinmin, et al.
Published: (2026)
Packing edge-colorings of subcubic outerplanar graphs
by: Li, Sijin, et al.
Published: (2024)
by: Li, Sijin, et al.
Published: (2024)
Partition subcubic planar graphs into independent sets
by: Liu, Xujun, et al.
Published: (2024)
by: Liu, Xujun, et al.
Published: (2024)
Between proper and square colorings of sparse graphs
by: Choi, Ilkyoo, et al.
Published: (2025)
by: Choi, Ilkyoo, 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)
by: Zein, Ayman El, et al.
Published: (2026)
On independent domination and packing numbers of subcubic graphs
by: Bai, Xuqing, et al.
Published: (2024)
by: Bai, Xuqing, 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)
by: Liu, Xujun, et al.
Published: (2026)
The DP-coloring of the square of subcubic graphs
by: Zhao, Ren
Published: (2024)
by: Zhao, Ren
Published: (2024)
Equitable coloring of sparse graphs
by: Liu, Weichan, et al.
Published: (2024)
by: Liu, Weichan, et al.
Published: (2024)
11/4-colorability of subcubic triangle-free graphs
by: Dvořák, Zdeněk, et al.
Published: (2022)
by: Dvořák, Zdeněk, et al.
Published: (2022)
2-distance 4-coloring of planar subcubic graphs with girth at least 21
by: La, Hoang, et al.
Published: (2021)
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)
by: Hou, Jingxi, et al.
Published: (2025)
Fast algorithm for $S$-packing coloring of Halin graphs
by: Zhang, Xin, et al.
Published: (2025)
by: Zhang, Xin, et al.
Published: (2025)
The $n/2$-bound for locating-dominating sets in subcubic graphs
by: Chakraborty, Dipayan, et al.
Published: (2024)
by: Chakraborty, Dipayan, et al.
Published: (2024)
Frustration indices of signed subcubic graphs
by: Chen, Sirui, et al.
Published: (2025)
by: Chen, Sirui, et al.
Published: (2025)
Approximate packing of independent transversals in locally sparse graphs
by: Chakraborti, Debsoumya, et al.
Published: (2024)
by: Chakraborti, Debsoumya, et al.
Published: (2024)
On odd colorings of sparse graphs
by: Wang, Tao, et al.
Published: (2022)
by: Wang, Tao, et al.
Published: (2022)
Strong edge-coloring of sparse graphs with Ore-degree 7 or 8
by: Wang, Runze
Published: (2026)
by: Wang, Runze
Published: (2026)
A note on strong edge-colorings of 2-degenerate graphs
by: Luo, Rong, et al.
Published: (2012)
by: Luo, Rong, et al.
Published: (2012)
Monochromatic cycles in 2-edge-colored bipartite graphs with large minimum degree
by: Zhang, Yiran, et al.
Published: (2023)
by: Zhang, Yiran, et al.
Published: (2023)
Rainbow matchings in edge-colored graphs
by: Lu, Hongliang, et al.
Published: (2025)
by: Lu, Hongliang, et al.
Published: (2025)
Fractional balanced chromatic number of signed subcubic graphs
by: Hu, Xiaolan, et al.
Published: (2025)
by: Hu, Xiaolan, 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)
by: Brešar, Boštjan, et al.
Published: (2024)
$t$-tone edge coloring of graphs
by: Bazzal, Hadeel Al
Published: (2026)
by: Bazzal, Hadeel Al
Published: (2026)
Coalition graphs of connected domination partitions in subcubic graphs
by: Dobrynin, Andrey A., et al.
Published: (2025)
by: Dobrynin, Andrey A., et al.
Published: (2025)
Median eigenvalues of subcubic graphs
by: Acharya, Hricha, et al.
Published: (2025)
by: Acharya, Hricha, et al.
Published: (2025)
On the independence number in subcubic graphs
by: Harant, Jochen, et al.
Published: (2025)
by: Harant, Jochen, et al.
Published: (2025)
Counting rainbow triangles in edge-colored graphs
by: Li, Xueliang, et al.
Published: (2021)
by: Li, Xueliang, et al.
Published: (2021)
Strong list-chromatic index of subcubic graphs is at most 10
by: Tang, Yunfang, et al.
Published: (2025)
by: Tang, Yunfang, et al.
Published: (2025)
Covering and 2-degree-packing numbers in graphs
by: Montufar, Carlos Alfaro, et al.
Published: (2017)
by: Montufar, Carlos Alfaro, et al.
Published: (2017)
Normal 6-edge-colorings of cubic graphs with oddness 2
by: Fabrici, Igor, et al.
Published: (2025)
by: Fabrici, Igor, et al.
Published: (2025)
Vertex-distinguishing edge coloring of graphs
by: Gao, Yuping, et al.
Published: (2025)
by: Gao, Yuping, et al.
Published: (2025)
Semistrong edge colorings of planar graphs
by: Lin, Yuquan, et al.
Published: (2024)
by: Lin, Yuquan, et al.
Published: (2024)
Strong odd coloring of sparse graphs
by: Kwon, Hyemin, et al.
Published: (2024)
by: Kwon, Hyemin, et al.
Published: (2024)
On packing total coloring
by: Ferme, Jasmina, et al.
Published: (2025)
by: Ferme, Jasmina, et al.
Published: (2025)
On locating and neighbor-locating colorings of sparse graphs
by: Chakraborty, Dipayan, et al.
Published: (2023)
by: Chakraborty, Dipayan, et al.
Published: (2023)
Computational results on semistrong edge coloring of graphs
by: Lin, Yuquan, et al.
Published: (2025)
by: Lin, Yuquan, et al.
Published: (2025)
Large rainbow matchings in edge-colored graphs
by: Chakraborti, Debsoumya, et al.
Published: (2020)
by: Chakraborti, Debsoumya, et al.
Published: (2020)
Similar Items
-
On the $(1^2,2^4)$-packing edge-coloring of subcubic graphs
by: Liu, Xujun, et al.
Published: (2024) -
Every subcubic graph is packing $(1,1,2,2,3)$-colorable
by: Liu, Xujun, et al.
Published: (2024) -
Every connected subcubic graph except the Petersen graph is packing $(1,1,2,2)$-colorable
by: Hou, Xinmin, 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)