[HTML][HTML] On some domination colorings of graphs
G Bagan, H Boumediene-Merouane, M Haddad… - Discrete Applied …, 2017 - Elsevier
G Bagan, H Boumediene-Merouane, M Haddad, H Kheddouci
Discrete Applied Mathematics, 2017•ElsevierIn this paper, we are interested in four proper vertex colorings of graphs, with additional
domination property. In the dominator colorings, strong colorings and strict strong colorings
of a graph G, every vertex has to dominate at least one color class. Conversely, in the
dominated colorings of G, every color class has to be dominated by at least one vertex. We
study arbitrary graphs as well as P 4-sparse graphs, P 5-free graphs, bounded treewidth
graphs and claw-free graphs.
domination property. In the dominator colorings, strong colorings and strict strong colorings
of a graph G, every vertex has to dominate at least one color class. Conversely, in the
dominated colorings of G, every color class has to be dominated by at least one vertex. We
study arbitrary graphs as well as P 4-sparse graphs, P 5-free graphs, bounded treewidth
graphs and claw-free graphs.
In this paper, we are interested in four proper vertex colorings of graphs, with additional domination property. In the dominator colorings, strong colorings and strict strong colorings of a graph G, every vertex has to dominate at least one color class. Conversely, in the dominated colorings of G, every color class has to be dominated by at least one vertex. We study arbitrary graphs as well as P 4-sparse graphs, P 5-free graphs, bounded treewidth graphs and claw-free graphs.
Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果