Equitable colorings of Cartesian products of graphs

DOI10.1016/j.dam.2011.09.020zbMath1241.05035OpenAlexW1997641913MaRDI QIDQ765364

Wu-Hsiung Lin, Gerard Jennhwa Chang

Publication date: 19 March 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.09.020

zbMATH Keywords

Cartesian productequitable chromatic numberequitable coloringequitable chromatic threshold

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (9)

Equitable chromatic number of weak modular product of Some graphs ⋮ Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs ⋮ Equitable colorings of corona multiproducts of graphs ⋮ A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS ⋮ The number of spanning trees of the Cartesian product of regular graphs ⋮ Equitable colorings of Cartesian products with balanced complete multipartite graphs ⋮ Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs ⋮ Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms ⋮ On equitable coloring of corona of wheels

Cites Work

• Equitable colorings of Kronecker products of graphs
• On equitable \(\Delta\)-coloring of graphs with low average degree
• A note on equitable colorings of forests
• An existential problem of a weight-controlled subset and its application to school timetable construction
• Equitable coloring of trees
• Equitable coloring and the maximum degree
• Mutual exclusion scheduling
• A survey on Hedetniemi's conjecture
• Equitable chromatic number of complete multipartite graphs
• Equitable list coloring of graphs
• Equitable colorings of outerplanar graphs
• On equitable coloring of bipartite graphs
• An Ore-type theorem on equitable coloring
• Equitable list-coloring for graphs of maximum degree 3
• Graphs with Given Group and Given Graph-Theoretical Properties
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• Equitable Coloring
• A list analogue of equitable coloring
• The infamous upper tail
• Equitable Colourings of d-degenerate Graphs
• On Equitable Coloring of d-Degenerate Graphs
• Perfect Graphs and an Application to Optimizing Municipal Services
• On the equitable chromatic number of complete \(n\)-partite graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equitable colorings of Cartesian products of graphs