Injective colouring for H-free graphs
From MaRDI portal
Publication:2117071
DOI10.1007/978-3-030-79416-3_2OpenAlexW3173593505MaRDI QIDQ2117071
Barnaby Martin, Nikola Jedličková, Siani Smith, Daniël Paulusma, Jan Bok
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79416-3_2
Related Items (6)
The complexity of \(L(p, q)\)-edge-labelling ⋮ Partitioning \(H\)-free graphs of bounded diameter ⋮ Hardness transitions and uniqueness of acyclic colouring ⋮ The complexity of \(L(p, q)\)-edge-labelling ⋮ Acyclic, star, and injective colouring: bounding the diameter ⋮ Acyclic, star, and injective colouring: bounding the diameter
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of injective colorings and its generalizations
- On the computational complexity of strong edge coloring
- On the injective chromatic number of graphs
- Colouring \((P_r + P_s)\)-free graphs
- List 3-coloring graphs with no induced \(P_6 + rP_3\)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
- Approximations for -Colorings of Graphs
- On Injective Colourings of Chordal Graphs
This page was built for publication: Injective colouring for H-free graphs
