scientific article; zbMATH DE number 764415

MaRDI QIDQ4836302zbMATH OpenFDO

Authors Marek Kubale, Jarosław Pakulski

Publication date 14 June 1995

zbMATH Keywords

approximate vertex coloringgreedy independent sets

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• The smallest hard-to-color graph
• Publication:4942486
• scientific article; zbMATH DE number 1594518
• scientific article; zbMATH DE number 1743833
• The smallest hard-to-color graph for algorithm DSATUR
• The smallest hard-to-color graph for the SL algorithm
• Coloring -colorable graphs using relatively small palettes
• Small \(H\)-coloring problems for bounded degree digraphs
• Coloring k-colorable graphs using smaller palettes
• On Approximately Counting Colorings of Small Degree Graphs

Cited in

(14)

• Numerical experiences with graph coloring algorithms
• The smallest hard-to-color graph
• The smallest hard-to-color graph for the SL algorithm
• scientific article; zbMATH DE number 1594518 (Why is no real title available?)
• scientific article; zbMATH DE number 3841898 (Why is no real title available?)
• Smallest-last ordering and clustering and graph coloring algorithms
• scientific article; zbMATH DE number 1234485 (Why is no real title available?)
• scientific article; zbMATH DE number 1452707 (Why is no real title available?)
• scientific article; zbMATH DE number 1743833 (Why is no real title available?)
• scientific article; zbMATH DE number 1419487 (Why is no real title available?)
• scientific article; zbMATH DE number 975381 (Why is no real title available?)
• Using Hajós’ Construction to Generate Hard Graph 3-Colorability Instances
• The smallest hard-to-color graph for algorithm DSATUR
• Small hard-to-color graphs for the SL algorithm

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 Q4836302)