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

DOI10.1080/00207727808941788zbMATH Open0402.05030OpenAlexW2058114780MaRDI QIDQ4186345FDOQ4186345

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

Publication date: 1978

Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (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

• Title not available (Why is that?)
• 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

This page was built for publication: A new method to find out the chromatic partition of a symmetric graph

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