Bounded vertex colorings of graphs
Open Access
- 1 February 1993
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 111 (1-3) , 305-312
- https://doi.org/10.1016/0012-365x(93)90165-p
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Chromatic optimisation: Limitations, objectives, uses, referencesEuropean Journal of Operational Research, 1982
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Critical perfect graphs and perfect 3-chromatic graphsJournal of Combinatorial Theory, Series B, 1977
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972
- On Complementary GraphsThe American Mathematical Monthly, 1956
- On colouring the nodes of a networkMathematical Proceedings of the Cambridge Philosophical Society, 1941