Equitable chromatic number of complete multipartite graphs
From MaRDI portal
Publication:1407486
zbMATH Open1027.05038MaRDI QIDQ1407486FDOQ1407486
Authors: Dorothee Blum, Denise Torrey, Richard H. Hammack 
Publication date: 7 January 2004
Published in: Missouri Journal of Mathematical Sciences (Search for Journal in Brave)
Recommendations
- On the equitable chromatic number of complete \(n\)-partite graphs
- Some chromatic equivalence classes of complete multipartite graphs
- Equitable total chromatic number of splitting graph
- Equitable total chromatic numbers of the square graphs of some graphs
- Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs
- A study of the total chromatic number of equibipartite graphs
- Total colorings of equibipartite graphs
- On equitable coloring of complete \(r\)-partite graphs
- On \(r\)-equitable coloring of complete multipartite graphs
- Equipartite edge colouring of multigraphs
Cited In (21)
- On \(r\)-equitable chromatic threshold of Kronecker products of complete graphs
- Equitable colorings of Kronecker products of graphs
- Equitable total coloring of complete $r$-partite $p$-balanced graphs
- Equitable coloring of Kneser graphs
- Improving lower bounds for equitable chromatic number
- Determining equitable total chromatic number for infinite classes of complete \(r\)-partite graphs
- On \(r\)-equitable colorings of bipartite graphs
- Equipartite edge colouring of multigraphs
- Equitable colorings of Cartesian products of square of cycles and paths with complete bipartite graphs
- On equitable coloring of complete \(r\)-partite graphs
- Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs
- Equitable colorings of Cartesian products of graphs
- On the equitable chromatic number of complete \(n\)-partite graphs
- Title not available (Why is that?)
- Equitable defective colorings of complete bipartite graphs
- The equitable colorings of Kneser graphs
- Proofs for some known results of equitable coloring
- Equitable colorings of line graphs and complete \(r\)-partite graphs
- Equitable total chromatic number of splitting graph
- The equitable total chromatic number of \(S_m\vee S_n\)
- On \(r\)-equitable coloring of complete multipartite graphs
This page was built for publication: Equitable chromatic number of complete multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1407486)
