Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
From MaRDI portal
Publication:326469
DOI10.1007/s10878-015-9895-5zbMath1348.05170OpenAlexW417070490MaRDI QIDQ326469
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
Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Equitable \(\Delta\)-coloring of graphs
- 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
- 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
- Equitable coloring and the maximum degree
- Mutual exclusion scheduling
- Equitable chromatic number of complete multipartite graphs
- Equitable colorings of outerplanar graphs
- On equitable coloring of bipartite graphs
- Equivalence of two conjectures on equitable coloring of graphs
- An Ore-type theorem on equitable coloring
- Graphs with Given Group and Given Graph-Theoretical Properties
- A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring
- Equitable Coloring
- The linear (n-1)-arboricity of Cartesian product graphs
- On the equitable chromatic number of complete \(n\)-partite graphs
This page was built for publication: Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
