Recommendations
Cites work
- A class of strongly perfect graphs
- A fast algorithm for coloring Meyniel graphs
- Clique-transversal sets and weak 2-colorings in graphs of small maximum degree
- Clique-transversal sets of line graphs and complements of line graphs
- Coloring the Maximal Cliques of Graphs
- Constructive lower bounds on classical multicolor Ramsey numbers
- scientific article; zbMATH DE number 3889565 (Why is no real title available?)
- scientific article; zbMATH DE number 3891425 (Why is no real title available?)
- scientific article; zbMATH DE number 46958 (Why is no real title available?)
- scientific article; zbMATH DE number 3503283 (Why is no real title available?)
- Path parity and perfection
- Star-cutsets and perfect graphs
- Symmetric sum-free partitions and lower bounds for Schur numbers
Cited in
(12)- Clique covers and coloring problems of graphs
- On the complexity of local-equitable coloring of graphs
- A generalization of Grötzsch Theorem on the local-equitable coloring
- A linear-time algorithm for clique-coloring planar graphs
- List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4
- Clique-chromatic numbers of line graphs.
- On Cliques and Clique Chromatic Numbers in Line, Lict and Lictact Graphs
- Coloring the Maximal Cliques of Graphs
- scientific article; zbMATH DE number 6747335 (Why is no real title available?)
- Clique-relaxed graph coloring
- Clique coloring EPT graphs on bounded degree trees
This page was built for publication: Coloring the cliques of line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401798)
