Equitable and m-bounded coloring of split graphs
- 1 January 1996
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On equitable coloring of bipartite graphsDiscrete Mathematics, 1996
- Equitable Coloring and the Maximum DegreeEuropean Journal of Combinatorics, 1994
- Equitable Coloring of TreesJournal of Combinatorial Theory, Series B, 1994
- A Note on the m-Bounded Chromatic Number of a TreeEuropean Journal of Combinatorics, 1993
- Equitable and proportional coloring of treesJournal of Combinatorial Theory, Series B, 1983
- Equitable ColoringThe American Mathematical Monthly, 1973