On indicated chromatic number of graphs
From MaRDI portal
Publication:2361087
Recommendations
Cites work
- An inequality for the chromatic number of a graph
- Chromatic graph theory
- Circular chromatic number and Mycielski construction
- Circular chromatic number and Mycielski graphs
- Circular chromatic numbers of Mycielski's graphs
- Cubic graphs on \(\leq 14\) vertices
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs
- scientific article; zbMATH DE number 821271 (Why is no real title available?)
- Indicated coloring of graphs
- On (\(P_{5}\), diamond)-free graphs
- On chromatic number of graphs and set-systems
- On indicated coloring of graphs
Cited in
(13)- Indicated coloring of Cartesian product of graphs
- Indicated coloring of graphs
- On game chromatic vertex-critical graphs
- On indicated coloring of lexicographic product of graphs
- Indicated coloring game on Cartesian products of graphs
- Finding the chromatic number by means of critical graphs
- scientific article; zbMATH DE number 6612443 (Why is no real title available?)
- Indicated coloring of matroids
- Indicated coloring of Cartesian product of some families of graphs.
- Indicated coloring of the Mycielskian of some families of graphs
- Brooks' type theorem for indicated coloring game
- Indicated coloring of some families of graphs
- On indicated coloring of graphs
This page was built for publication: On indicated chromatic number of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361087)