A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS

DOI10.17654/0974165823003OpenAlexW4313287666MaRDI QIDQ6115138

Unnamed Author, Unnamed Author

Publication date: 15 August 2023

Published in: Advances and Applications in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17654/0974165823003

zbMATH Keywords

equitable chromatic numberequitable coloringequitable chromatic thresholdMycielski's graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equitable colorings of Cartesian products of graphs
• Equitable colorings of bounded treewidth graphs
• Equitable coloring of trees
• On equitable coloring of bipartite graphs
• The corona between cycles and paths
• Handbook of Graph Theory
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• Equitable Coloring
• A textbook of graph theory

This page was built for publication: A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS