On the colorability of m-composed graphs

DOI10.1016/0012-365X(94)90025-6zbMATH Open0809.05043OpenAlexW2050738054MaRDI QIDQ1336697FDOQ1336697

Authors: R. Klein 

Publication date: 20 March 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90025-6

Recommendations

• scientific article; zbMATH DE number 825142
• scientific article; zbMATH DE number 653253
• scientific article; zbMATH DE number 819126
• scientific article; zbMATH DE number 889958
• Some bounds on the generalised total chromatic number of degenerate graphs

zbMATH Keywords

graph coloringcolorability\(m\)-composed graph\(m\)-degenerated graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Nowhere-zero 6-flows
• Title not available (Why is that?)
• Colour-critical graphs and hypergraphs

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On the colorability of \(m\)-composed graphs

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