Maximum colorful independent sets in vertex-colored graphs
- 17 July 2018
- journal article
- research article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 68, 251-256
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Colorful Paths in Vertex Coloring of GraphsThe Electronic Journal of Combinatorics, 2011
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPHJournal of the Operations Research Society of Japan, 2001
- Decomposition by clique separatorsDiscrete Mathematics, 1985
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965