The injective chromatic index of a claw-free subcubic graph is at most 6

DOI10.3770/J.ISSN:2095-2651.2023.04.004MaRDI QIDQ6167747zbMATH OpenFDO

Authors Xiaoyuan Dong, Yuquan Lin, Wensong Lin

Publication date 7 August 2023

zbMATH Keywords

subcubic graphclaw-freeinjective edge coloringinjective chromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• List injective edge-coloring of subcubic graphs
• Injective edge-coloring of graphs with small weight
• Injective edge-coloring of subcubic graphs
• Injective chromatic index of \(K_4\)-minor free graphs
• On injective edge-coloring of graphs with maximum degree 4

Cites work

• 10-tough chordal graphs are Hamiltonian
• Characterizations of derived graphs
• Generalized honeycomb torus is Hamiltonian
• Induced and weak induced arboricities
• Injective edge coloring of graphs
• Injective edge coloring of sparse graphs
• Injective edge-coloring of graphs with given maximum degree
• Injective edge-coloring of subcubic graphs
• Note on the perfect EIC-graphs
• On the injective chromatic number of graphs
• The strong chromatic index of a class of graphs
• Updating the hamiltonian problem—A survey

Cited in

(1)

• Determining chromatic index of cubic graph with the use of explainable classifiers: a comparative study

This page was built for publication: The injective chromatic index of a claw-free subcubic graph is at most 6

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