A new method to find out the chromatic partition of a symmetric graph

DOI10.1080/00207727808941788zbMath0402.05030OpenAlexW2058114780MaRDI QIDQ4186345

Bhabani P. Sinha, Pradip K. Srimani, A. K. Choudhury

Publication date: 1978

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207727808941788

zbMATH Keywords

Chromatic NumberChromatic PartitionMaximal Linearly Independent SubsetsMinimal Covering CollectionSymmetric GraphTwo-Stage Algorithm

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99) Theory of software (68N99) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites Work

• Unnamed Item
• A practical approach to the chromatic partition problem
• Some Studies on Connected Cover Term Matrices of Switching Functions†
• An Approach for Simplifying Switching Functions by Utilizing the Cover Table Representation