On strong edge-coloring of claw-free subcubic graphs

DOI10.1007/S00373-022-02462-6zbMATH Open1485.05065OpenAlexW4220989689MaRDI QIDQ2117528FDOQ2117528

Xiaoxia Zhang, Jianbo Lv, Jianxi 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

zbMATH Keywords

strong chromatic indexclaw-free subcubic graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A bound on the strong chromatic index of a graph
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10
• Induced matchings in cubic graphs
• A stronger bound for the strong chromatic index (extended abstract)
• Strong chromatic index of graphs with maximum degree four
• Strong chromatic index of \(K_{1, t}\)-free graphs
• On strong edge-coloring of graphs with maximum degree 4

Cited In (4)

• A note on strong edge-coloring of claw-free cubic graphs
• On strong edge-coloring of graphs with maximum degree 5
• Strong edge colorings of graphs and the covers of Kneser graphs
• The tight bound for the strong chromatic indices of claw-free subcubic graphs

This page was built for publication: On strong edge-coloring of claw-free subcubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117528)