Packing edge-colorings of subcubic outerplanar graphs
Authors:
- Sijin LiSLSijin Li
- Yifan LiYLYifan Li
- Xujun LiuXLXujun Liu
- 7 May 2026
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 391, 68-82
Abstract
No abstract availableAll Related Versions
Funding Information
- Xi’an Jiaotong-Liverpool University
- National Natural Science Foundation of China
This publication has 21 references indexed in Scilit:
- Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorableJournal of Graph Theory, 2023
- Between proper and strong edge‐colorings of subcubic graphsJournal of Graph Theory, 2022
- Strong edge colorings of graphs and the covers of Kneser graphsJournal of Graph Theory, 2022
- Packing
(
1
,
1
,
2
,
4
)
-coloring of subcubic outerplanar graphsDiscrete Applied Mathematics, 2021
- Packing colorings of subcubic outerplanar graphsAequationes mathematicae, 2020
- On -packing edge-colorings of cubic graphsDiscrete Applied Mathematics, 2019
- On the packing chromatic number of subcubic outerplanar graphsDiscrete Applied Mathematics, 2019
- A Bound on the Strong Chromatic Index of a GraphJournal of Combinatorial Theory, Series B, 1997
- Induced matchings in cubic graphsJournal of Graph Theory, 1993
- The strong chromatic index of a cubic graph is at most 10Discrete Mathematics, 1992