Relations between the domination parameters and the chromatic index of a graph
From MaRDI portal
Publication:3560786
DOI10.7151/DMGT.1468zbMATH Open1194.05119OpenAlexW2064311485MaRDI QIDQ3560786FDOQ3560786
Authors: Włodzimierz Ulatowski
Publication date: 14 May 2010
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2021d38729f936f647a1c29e35f558083a9a3f04
Recommendations
- Relations between the lower domination parameters and the chromatic number of a graph.
- scientific article; zbMATH DE number 1933059
- New parameters involving chromatic sum in a graph
- Independent domination and graph colorings
- Some upper bounds for the product of the domination number and the chromatic number of a graph
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cited In (4)
- Some upper bounds for the product of the domination number and the chromatic number of a graph
- Inequalities between the domination number and the chromatic number of a graph
- Relations between the lower domination parameters and the chromatic number of a graph.
- New parameters involving chromatic sum in a graph
This page was built for publication: Relations between the domination parameters and the chromatic index of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3560786)