On strong edge-coloring of claw-free subcubic graphs
From MaRDI portal
Publication:2117528
DOI10.1007/s00373-022-02462-6zbMath1485.05065OpenAlexW4220989689MaRDI QIDQ2117528
Xiaoxia Zhang, Jian-Bo Lv, Jian Xi Li
Publication date: 21 March 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02462-6
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (3)
The tight bound for the strong chromatic indices of claw-free subcubic graphs ⋮ A note on strong edge-coloring of claw-free cubic graphs ⋮ On strong edge-coloring of graphs with maximum degree 5
Cites Work
- A stronger bound for the strong chromatic index (extended abstract)
- Strong chromatic index of \(K_{1, t}\)-free graphs
- Problems and results in combinatorial analysis and graph theory
- The strong chromatic index of a cubic graph is at most 10
- A bound on the strong chromatic index of a graph
- Strong chromatic index of graphs with maximum degree four
- On strong edge-coloring of graphs with maximum degree 4
- Induced matchings in cubic graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: On strong edge-coloring of claw-free subcubic graphs
