Equitable colorings of Cartesian products with balanced complete multipartite graphs
From MaRDI portal
(Redirected from Publication:476328)
Recommendations
- The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4
- Equitable colorings of Cartesian products of graphs
- Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
- Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
- Equitable coloring of Cartesian product of some graphs.
Cites work
- Equitable Coloring
- Equitable coloring of graph product
- Equitable colorings of Cartesian products of graphs
- Graphs with Given Group and Given Graph-Theoretical Properties
- Handbook of combinatorial optimization. In 5 volumes
- The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4
Cited in
(10)- Equitable critical graphs
- Equitable coloring of graph product
- Equitable total coloring of complete $r$-partite $p$-balanced graphs
- Equitable chromatic threshold of direct products of complete graphs.
- 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 coloring of Kronecker products of complete multipartite graphs and complete graphs
- Equitable colorings of Cartesian products of graphs
- Equitable colorings of a special class of Cartesian products of graphs
- Equitable colorings of line graphs and complete \(r\)-partite graphs
This page was built for publication: Equitable colorings of Cartesian products with balanced complete multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q476328)