Block graphs — Some general results and their equitable colorings
Authors:
- Hanna FurmańczykHFHanna Furmańczyk
- Vahan MkrtchyanVMVahan Mkrtchyan
- 13 February 2026
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 385, 178-193
Abstract
No abstract availableAll Related Versions
Funding Information
- Ministero dell’Istruzione, dell’Università e della Ricerca
This publication has 11 references indexed in Scilit:
- Proof of the Goldberg–Seymour conjecture on edge–colorings of multigraphsJournal of Combinatorial Optimization, 2025
- Gap one bounds for the equitable chromatic number of block graphsDiscrete Applied Mathematics, 2023
- Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and KernelizationAlgorithmica, 2022
- Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machinesDiscrete Applied Mathematics, 2018
- A note on equitable colorings of forestsEuropean Journal of Combinatorics, 2009
- Equitable colorings of bounded treewidth graphsTheoretical Computer Science, 2005
- Equitable Coloring of Graphs2004
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and TutteProceedings of the London Mathematical Society, 1979
- The chromatic class of a multigraphCybernetics and Systems Analysis, 1965