Gap one bounds for the equitable chromatic number of block graphs
Open Access
- 7 October 2023
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 354, 15-28
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Narodowe Centrum Nauki (2017/01/X/ST6/00148)
- Ministero dell’Istruzione, dell’Università e della Ricerca
This publication has 11 references indexed in Scilit:
- Edge-coloring of 3-uniform hypergraphsDiscrete Applied Mathematics, 2017
- A note on equitable colorings of forestsEuropean Journal of Combinatorics, 2009
- Equitable colorings of bounded treewidth graphsTheoretical Computer Science, 2005
- A Simple Proof of the Gale-Ryser TheoremThe American Mathematical Monthly, 1996
- Restrictions of graph partition problems. Part ITheoretical Computer Science, 1995
- Linear hypertree for multi-dimensional image representationInformation Sciences, 1993
- On the combinatorial problems which I would most like to see solvedCombinatorica, 1981
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and TutteProceedings of the London Mathematical Society, 1979
- On edge-colorings of graphs.MATHEMATICA SCANDINAVICA, 1977
- The chromatic class of a multigraphCybernetics and Systems Analysis, 1965