A practical approach to the chromatic partition problem

DOI10.1016/0016-0032(70)90202-4zbMath0295.05104OpenAlexW2075349994MaRDI QIDQ1212946

W. H. Kim, R. S. Wilkov

Publication date: 1970

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(70)90202-4

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (2)

A new method to find out the chromatic partition of a symmetric graph ⋮ The clique-partitioning problem

Cites Work

• Unnamed Item
• A method for finding Hamilton paths and Knight's tours
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• The structure of k-chromatic graphs
• Paths and Circuits in Critical Graphs

This page was built for publication: A practical approach to the chromatic partition problem