Chromaticity of Turán graphs with at most three edges deleted
From MaRDI portal
Publication:5249347
zbMATH Open1310.05093MaRDI QIDQ5249347FDOQ5249347
Authors: Gee-Choon Lau, Saeid Alikhani, Y. H. Peng
Publication date: 4 May 2015
Full work available at URL: http://www.ijmsi.ir/browse.php?slc_lang=en&sid=1&a_id=642
Recommendations
- scientific article; zbMATH DE number 5963814
- scientific article; zbMATH DE number 6007676
- Chromaticity of complete 6-partite graphs with certain star or matching deleted. II
- Chromaticity of complete 5-partite graphs with certain star or matching deleted
- Chromaticity of complete 6-partite graphs with certain star or matching deleted
Graph polynomials (05C31) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15)
Cited In (4)
This page was built for publication: Chromaticity of Turán graphs with at most three edges deleted
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249347)