Inapproximability of the lid-chromatic number
From MaRDI portal
Publication:324747
Recommendations
Cites work
- scientific article; zbMATH DE number 3896983 (Why is no real title available?)
- scientific article; zbMATH DE number 907924 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- A tree representation for \(P_ 4\)-sparse graphs
- Complement reducible graphs
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Locally identifying coloring in bounded expansion classes of graphs
- Locally identifying coloring of graphs
- Locally identifying colourings for graphs with given maximum degree
- On a new class of codes for identifying vertices in graphs
- Vertex-distinguishing edge colorings of graphs
- Vertex-distinguishing proper edge-colorings
Cited in
(5)
This page was built for publication: Inapproximability of the lid-chromatic number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324747)