Equitable colorings of Cartesian products of graphs
From MaRDI portal
Publication:765364
DOI10.1016/J.DAM.2011.09.020zbMATH Open1241.05035OpenAlexW1997641913MaRDI QIDQ765364FDOQ765364
Authors: 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
Recommendations
- Equitable colorings of a special class of Cartesian products of graphs
- Equitable coloring of Cartesian product of some graphs.
- Equitable colorings of Cartesian products with balanced complete multipartite graphs
- Equitable coloring of graph product
- Equitable colorings of Kronecker products of graphs
- Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
- scientific article; zbMATH DE number 6538114
- Equitable colorings of Cartesian products of fans with bipartite graphs
- scientific article; zbMATH DE number 7714105
- Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
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?)
- Title not available (Why is that?)
- A survey on Hedetniemi's conjecture
- Graphs with Given Group and Given Graph-Theoretical Properties
- Title not available (Why is that?)
- Equitable coloring and the maximum degree
- Equitable colorings of outerplanar graphs
- On equitable coloring of bipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equitable Coloring
- 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
- Mutual exclusion scheduling
- Equitable chromatic number of complete multipartite graphs
- On the equitable chromatic number of complete \(n\)-partite graphs
- Title not available (Why is that?)
- Perfect Graphs and an Application to Optimizing Municipal Services
- The infamous upper tail
- Equitable list coloring of graphs
- Equitable list-coloring for graphs of maximum degree 3
- A list analogue of equitable coloring
- Equitable Colourings of d-degenerate Graphs
- On equitable \(\Delta\)-coloring of graphs with low average degree
- Equitable coloring of graph product
- Equitable colorings of Kronecker products of graphs
- Title not available (Why is that?)
- On Equitable Coloring of d-Degenerate Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (21)
- Equitable coloring of corona products of cubic graphs is harder than ordinary coloring
- Equitable chromatic number of weak modular product of some graphs
- Equitable colorings of Kronecker products of graphs
- Equitable colorings of \(l\)-corona products of cubic graphs
- A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS
- Equitable coloring of graph product
- Equitable chromatic threshold of direct products of complete graphs.
- Equitable distinguishing chromatic number
- Title not available (Why is that?)
- Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
- The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4
- Equitable edge coloring on tensor product of graphs
- Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
- Equitable colorings of Cartesian products with balanced complete multipartite graphs
- On equitable coloring of corona of wheels
- Equitable colorings of a special class of Cartesian products of graphs
- Equitable colorings of Cartesian products of fans with bipartite graphs
- Equitable coloring of Cartesian product of some graphs.
- Equitable colorings of corona multiproducts of graphs
- Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
- The number of spanning trees of the Cartesian product of regular graphs
This page was built for publication: Equitable colorings of Cartesian products of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765364)
