Chromatic Numbers for Certain Graphs

DOI10.1112/JLMS/S2-4.3.489MaRDI QIDQ5641167zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(10)

• Some coloring numbers for complete r-partite graphs
• The edge-coloring of complete hypergraphs. I
• Pseudo-one-factorizations of regular graphs of odd order. II: Products of graphs
• Embeddings of m-cycle systems and incomplete m-cycle systems: m 14
• The achromatic indices of the regular complete multipartite graphs
• Double graphs
• Minimizing drop cost for SONET/WDM networks with 18 wavelength requirements
• Interval edge-coloring: A model of curriculum scheduling
• Gain total graphs and their spectra via G-phases and group representations
• On the chromatic edge stability index of planar and regular graphs

This page was built for publication: Chromatic Numbers for Certain Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5641167)