Injective colouring for H-free graphs
From MaRDI portal
Publication:2117071
DOI10.1007/978-3-030-79416-3_2OpenAlexW3173593505MaRDI QIDQ2117071FDOQ2117071
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
Cites Work
- Title not available (Why is that?)
- Approximations for -Colorings of Graphs
- Title not available (Why is that?)
- On the injective chromatic number of graphs
- On the complexity of injective colorings and its generalizations
- On Injective Colourings of Chordal Graphs
- On the computational complexity of strong edge coloring
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
- Colouring \((P_r + P_s)\)-free graphs
- List 3-coloring graphs with no induced \(P_6 + rP_3\)
- Title not available (Why is that?)
Cited In (8)
- Hardness transitions and uniqueness of acyclic colouring
- Acyclic, star, and injective colouring: bounding the diameter
- Acyclic, star, and injective colouring: bounding the diameter
- Surjective H-Colouring over Reflexive Digraphs
- Partitioning \(H\)-free graphs of bounded diameter
- The complexity of \(L(p, q)\)-edge-labelling
- The complexity of \(L(p, q)\)-edge-labelling
- Making an H $H$‐free graph k $k$‐colorable
This page was built for publication: Injective colouring for H-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117071)
