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

DOI10.1007/S10878-015-9895-5zbMATH Open1348.05170OpenAlexW417070490MaRDI QIDQ326469FDOQ326469

Liancui Zuo, Shasha Ma

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

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

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)

Cites Work

• An Ore-type theorem on equitable coloring
• A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
• Title not available (Why is that?)
• Graphs with Given Group and Given Graph-Theoretical Properties
• Equitable coloring and the maximum degree
• Equitable colorings of outerplanar graphs
• On equitable coloring of bipartite graphs
• Equitable \(\Delta\)-coloring of graphs
• Equitable Coloring
• A note on equitable colorings of forests
• Equitable total coloring of \(C_m\square C_n\)
• An existential problem of a weight-controlled subset and its application to school timetable construction
• Equitable and proportional coloring of trees
• Equitable coloring of trees
• Mutual exclusion scheduling
• Equitable chromatic number of complete multipartite graphs
• Equivalence of two conjectures on equitable coloring of 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
• On the equitable chromatic number of complete \(n\)-partite graphs
• Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
• Equitable colorings of Cartesian products of graphs

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Equitable colorings of Cartesian products of 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)