Injective colouring for H-free graphs
type: Item
instance of: scholarly article
title: Injective colouring for H-free graphs
DOI: 10.1007/978-3-030-79416-3_2
author: Jan Bok
author: Nikola Jedličková
author: Barnaby Martin
author: Daniël Paulusma
author: Siani Smith
publication date: 2022-03-21T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7493522
MaRDI profile type: Publication
full work available at URL: 978-3-030-79416-3 2
OpenAlex ID: W3173593505
cites work: Approximations for -Colorings of Graphs
cites work: Q5874489
cites work: List 3-coloring graphs with no induced \(P_6 + rP_3\)
cites work: A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
cites work: On the injective chromatic number of graphs
cites work: Q4209364
cites work: On Injective Colourings of Chordal Graphs
cites work: On the complexity of injective colorings and its generalizations
cites work: Colouring \((P_r + P_s)\)-free graphs
cites work: Q4448764
cites work: On the computational complexity of strong edge coloring
description: scientific article; zbMATH DE number 7493522