On indicated coloring of graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- Complement reducible graphs
- Dominating cliques in \(P_ 5\)-free graphs
- Indicated coloring of graphs
- On (\(P_{5}\), diamond)-free graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- Paw-free graphs
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
Cited in
(11)- On game chromatic vertex-critical graphs
- Indicated coloring game on Cartesian products of graphs
- Indicated coloring of matroids
- Indicated coloring of Cartesian product of some families of graphs.
- On indicated coloring of lexicographic product of graphs
- Indicated coloring of the Mycielskian of some families of graphs
- Indicated coloring of complete expansion and lexicographic product of graphs
- Indicated coloring of Cartesian product of graphs
- scientific article; zbMATH DE number 1305541 (Why is no real title available?)
- Indicated coloring of graphs
- On indicated chromatic number of graphs
This page was built for publication: On indicated coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897289)