Injective colouring for H-free graphs

DOI10.1007/978-3-030-79416-3_2MaRDI QIDQ2117071zbMATH OpenOpenAlexFDO

Authors Jan Bok, Nikola Jedličková, Barnaby Martin, Daniël Paulusma, Siani Smith

Publication date 21 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-79416-3_2

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1202982 (Why is no real title available?)
• scientific article; zbMATH DE number 2044943 (Why is no real title available?)
• scientific article; zbMATH DE number 7651161 (Why is no real title available?)
• A survey on the computational complexity of coloring graphs with forbidden subgraphs
• Approximations for  -Colorings of Graphs
• Colouring \((P_r + P_s)\)-free graphs
• List 3-coloring graphs with no induced \(P_6 + rP_3\)
• On Injective Colourings of Chordal Graphs
• On the complexity of injective colorings and its generalizations
• On the computational complexity of strong edge coloring
• On the injective chromatic number of graphs

Cited in

(8)

• The complexity of \(L(p, q)\)-edge-labelling
• Making an H $H$‐free graph k $k$‐colorable
• Acyclic, star, and injective colouring: bounding the diameter
• Surjective H-Colouring over Reflexive Digraphs
• Hardness transitions and uniqueness of acyclic colouring
• Acyclic, star, and injective colouring: bounding the diameter
• The complexity of \(L(p, q)\)-edge-labelling
• Partitioning \(H\)-free graphs of bounded diameter

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)