Injective edge-coloring of subcubic graphs
From MaRDI portal
Publication:6115745
DOI10.1142/s1793830922500409zbMath1516.05064arXiv1907.09838OpenAlexW4200108416WikidataQ114071636 ScholiaQ114071636MaRDI QIDQ6115745
Unnamed Author, Andre Raspaud, Samia Kerdjoudj
Publication date: 13 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.09838
Related Items (3)
Injective edge coloring of some sparse graphs ⋮ Complexity and algorithms for injective edge coloring of graphs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The strong chromatic index of a cubic graph is at most 10
- Every planar graph has an acyclic 7-coloring
- On acyclic colorings of planar graphs
- A bound on the strong chromatic index of a graph
- Induced and weak induced arboricities
- Every planar graph has an acyclic 8-coloring
- On the injective chromatic number of graphs
- Coloring with no 2-colored \(P_4\)'s
- Injective edge-coloring of graphs with given maximum degree
- On strong edge-colouring of subcubic graphs
- Star coloring of graphs
- Star coloring planar graphs from small lists
- Star coloring of sparse graphs
- Acyclic Colourings of Planar Graphs with Large Girth
- Cages—a survey
- Graph Classes: A Survey
- A Stronger Bound for the Strong Chromatic Index
- Injective edge coloring of sparse graphs
- Injective edge coloring of graphs
- Homomorphisms of 2-edge-colored graphs
- Acyclic colorings of planar graphs
This page was built for publication: Injective edge-coloring of subcubic graphs
