A strict strong coloring of trees

DOI10.1016/j.ipl.2009.06.012zbMath1197.05049OpenAlexW2031903046MaRDI QIDQ989572

Hamamache Kheddouci, Mohammed Haddad

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.06.012

zbMATH Keywords

algorithmstreesstrict strong chromatic numberstrict strong coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

On some domination colorings of graphs ⋮ On the double total dominator chromatic number of graphs ⋮ On strict strong coloring of graphs ⋮ Dominated colorings of graphs

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Total colourings of planar graphs with large girth
• Relations between the lower domination parameters and the chromatic number of a graph.
• Vertex colorings with a distance restriction
• Partial list colorings
• A new kind of graph coloring
• Edge coloring of bipartite graphs with constraints

This page was built for publication: A strict strong coloring of trees