Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs

DOI10.1007/S10878-015-9895-5MaRDI QIDQ326469zbMATH OpenOpenAlexFDO

Authors Shasha Ma, Liancui Zuo

Publication date 12 October 2016

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-015-9895-5

zbMATH Keywords

equitable coloringCartesian productequitable chromatic numberequitable chromatic threshold

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Equitable colorings of Cartesian products of graphs
• Equitable coloring of Cartesian product of some graphs.
• Equitable chromatic threshold of direct products of complete graphs.
• Equitable colorings of Kronecker products of graphs
• The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4

Cites work

• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• A note on equitable colorings of forests
• An Ore-type theorem on equitable coloring
• An existential problem of a weight-controlled subset and its application to school timetable construction
• Equitable Coloring
• Equitable \(\Delta\)-coloring of graphs
• Equitable and proportional coloring of trees
• Equitable chromatic number of complete multipartite graphs
• Equitable coloring and the maximum degree
• Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
• Equitable coloring of trees
• Equitable colorings of Cartesian products of graphs
• Equitable colorings of outerplanar graphs
• Equitable total coloring of \(C_m\square C_n\)
• Equivalence of two conjectures on equitable coloring of graphs
• Graph theory with applications
• Graphs with Given Group and Given Graph-Theoretical Properties
• Mutual exclusion scheduling
• On equitable coloring of bipartite graphs
• On the equitable chromatic number of complete \(n\)-partite graphs
• The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4
• The linear \((n-1)\)-arboricity of Cartesian product graphs

Cited in

(10)

• Equitable colorings of Kronecker products of graphs
• Equitable chromatic number of weak modular product of some graphs
• Equitable coloring of graph product
• scientific article; zbMATH DE number 5942282 (Why is no real title available?)
• Equitable distinguishing chromatic number
• scientific article; zbMATH DE number 6538114 (Why is no real title available?)
• The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4
• Equitable colorings of Cartesian products with balanced complete multipartite graphs
• Equitable colorings of Cartesian products of graphs
• Equitable coloring of Cartesian product of some graphs.

This page was built for publication: Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326469)