A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS
From MaRDI portal
Publication:6115138
Cites work
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- A textbook of graph theory
- Equitable Coloring
- Equitable coloring of corona products of graphs
- Equitable coloring of Mycielskian of some graphs
- Equitable coloring of trees
- Equitable colorings of bounded treewidth graphs
- Equitable colorings of Cartesian products of graphs
- Equitable colorings of line graphs and complete \(r\)-partite graphs
- Graph theory with applications
- Handbook of graph theory
- scientific article; zbMATH DE number 1302199 (Why is no real title available?)
- scientific article; zbMATH DE number 1308943 (Why is no real title available?)
- scientific article; zbMATH DE number 1046311 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- On equitable coloring of bipartite graphs
- The corona between cycles and paths
This page was built for publication: A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6115138)