DSATUR

swMATH3004MaRDI QIDQ15538FDOQ15538

Author name not available (Why is that?)

Described by source

• The smallest hard-to-color graph for algorithm DSATUR

Cited In (7)

• Bounding vertex coloring by truncatedmultistage branch and bound
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Vertex coloring of a graph for memory constrained scenarios
• A branch-and-cut algorithm for graph coloring
• Title not available (Why is that?)

This page was built for software: DSATUR