scientific article; zbMATH DE number 1305541

MaRDI QIDQ4252433zbMATH OpenFDO

Authors Ingo Schiermeyer, Bert Randerath

Publication date 17 June 1999

zbMATH Keywords

chromatic numberpolynomial time algorithms

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Colouring Graphs with Prescribed Induced Cycle Lengths
• Color-induced graph colorings
• Color-induced graph colorings
• Coloring graphs without short cycles and long induced paths
• Coloring graphs without short cycles and long induced paths
• Properly colored cycles of different lengths in edge-colored complete graphs
• Coloring graphs with two odd cycle lengths
• On indicated coloring of graphs

Cited in

(3)

• Triangle-free graphs and forbidden subgraphs
• Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case
• Colouring of cycles in the de bruijn graphs

This page was built for publication:

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