Chromaticity of complete 6-partite graphs with certain star or matching deleted. II
From MaRDI portal
Publication:1945962
DOI10.1007/s10255-013-0206-6zbMath1261.05027OpenAlexW2061087201MaRDI QIDQ1945962
Yee-Hock Peng, Ameen Shaman Ameen, Roslan Hasni, Hai-xing Zhao
Publication date: 17 April 2013
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-013-0206-6
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The search for chromatically unique graphs
- The search for chromatically unique graphs. II
- Classification of complete 5-partite graphs and chromaticity of 5-partite graphs with \(5n\) vertices
- Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs
- Expansions of Chromatic Polynomials and Log-Concavity
- Chromaticity of complete 4-partite graphs with certain star or matching deleted
This page was built for publication: Chromaticity of complete 6-partite graphs with certain star or matching deleted. II