List injective edge-coloring of subcubic graphs
From MaRDI portal
Publication:2043370
Recommendations
Cites work
- 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?)
- Combinatorial Nullstellensatz
- Graph theory
- Injective edge coloring of graphs
- Injective edge-coloring of graphs with given maximum degree
- List star edge coloring of sparse graphs
Cited in
(17)- Injective edge-coloring of graphs with small weight
- Injective edge-coloring of subcubic graphs
- List star edge-coloring of subcubic graphs
- Complexity and algorithms for injective edge coloring of graphs
- Note on list star edge‐coloring of subcubic graphs
- Injective edge coloring of graphs with maximum degree 5
- Injective chromatic index of \(K_4\)-minor free graphs
- Injective edge-coloring of claw-free subcubic graphs
- Complexity and algorithms for injective edge-coloring in graphs
- On injective edge-coloring of graphs with maximum degree 4
- Injective chromatic index of sparse graphs
- The injective chromatic index of a claw-free subcubic graph is at most 6
- List-Coloring Squares of Sparse Subcubic Graphs
- Injective edge coloring of power graphs and necklaces
- Injective edge coloring of some standard graph products
- Injective-edge-coloring of planar graphs with girth restriction
- Injective edge coloring of sparse 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)