Chromatic Numbers for Certain Graphs
From MaRDI portal
Publication:5641167
DOI10.1112/jlms/s2-4.3.489zbMath0233.05106OpenAlexW2034434342MaRDI QIDQ5641167
William R. Hare, Renu C. Laskar
Publication date: 1972
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-4.3.489
Related Items
The achromatic indices of the regular complete multipartite graphs, Embeddings of \(m\)-cycle systems and incomplete \(m\)-cycle systems: \(m\leq 14\), Minimizing drop cost for SONET/WDM networks with ? wavelength requirements, Double graphs, Some coloring numbers for complete r-partite graphs, The edge-coloring of complete hypergraphs. I, Interval edge-coloring: A model of curriculum scheduling, Pseudo-one-factorizations of regular graphs of odd order. II: Products of graphs
