List injective edge-coloring of subcubic graphs
The authors consider a recently introduced notion of edge-colouring of graphs, namely injective edge-colouring, where two edges must be assigned distinct colours if they are the end-edges of a 3-edge path or if they belong to a common triangle. (Note that incident edges could receive the same colour.) The injective chromatic index of a graph is the smallest number of colours needed in such a colouring. More specifically, this short note is concerned with the list version of the injective chromatic index -- for which each edge takes some arbitrary list of assignable colours -- and show that it is bounded by \(7\) for graphs of maximum degree \(3\). Most of the proof is a case analysis to reduce the problem to the Petersen graph, which is then handled with combinatorial Nullstellensatz and a computer check. They conjecture that their bound can be reduced from \(7\) to \(6\), which would be sharp if true.
- Combinatorial Nullstellensatz
- Graph theory
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 3563170 (Why is no real title available?)
- scientific article; zbMATH DE number 3243267 (Why is no real title available?)
- Injective edge coloring of graphs
- Injective edge-coloring of graphs with given maximum degree
- List star edge coloring of sparse graphs
- List star edge-coloring of subcubic graphs
- Complexity and algorithms for injective edge-coloring in graphs
- Injective edge-coloring of graphs with small weight
- Injective edge coloring of sparse graphs with maximum degree 5
- List-Coloring Squares of Sparse Subcubic Graphs
- Note on list star edge‐coloring of subcubic graphs
- Injective edge coloring of power graphs and necklaces
- Injective edge-coloring of subcubic graphs
- Complexity and algorithms for injective edge coloring of graphs
- Injective chromatic index of sparse graphs
- Injective edge coloring of graphs with maximum degree 5
- The injective chromatic index of a claw-free subcubic graph is at most 6
- Injective chromatic index of K₄-minor free graphs
- Injective edge coloring of some standard graph products
- Injective-edge-coloring of planar graphs with girth restriction
- Injective edge-coloring of claw-free subcubic graphs
- On injective edge-coloring of graphs with maximum degree 4
- Injective edge coloring of sparse graphs
- Further results on injective edge coloring of graphs with maximum degree 5
This page was built for publication: List injective edge-coloring of subcubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2043370)
