Injective edge-coloring of claw-free subcubic graphs
From MaRDI portal
Publication:6645183
DOI10.1007/s10878-024-01188-wMaRDI QIDQ6645183
Publication date: 28 November 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Cites Work
- Injective colorings of graphs with low average degree
- Injective colorings of sparse graphs
- Induced and weak induced arboricities
- On the injective chromatic number of graphs
- Some results on the injective chromatic number of graphs
- Complexity and algorithms for injective edge-coloring in graphs
- Injective edge-coloring of graphs with given maximum degree
- List injective edge-coloring of subcubic graphs
- Note on injective edge-coloring of graphs
- Injective edge-coloring of graphs with small weight
- Sharp upper bound of injective coloring of planar graphs with girth at least 5
- Injective edge coloring for graphs with small edge weight
- Combinatorial Nullstellensatz
- Injective edge coloring of sparse graphs
- Injective edge coloring of graphs
- Injective edge-coloring of subcubic graphs
This page was built for publication: Injective edge-coloring of claw-free subcubic graphs