On strict strong coloring of graphs

DOI10.1142/S1793830921500403MaRDI QIDQ5013494zbMATH OpenOpenAlexFDO

Authors A. Mohammed Abid, T. R. Ramesh Rao

Publication date 30 November 2021

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830921500403

zbMATH Keywords

Mycielskian graphproper coloringstrict strong chromatic numberstrict strong coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• A strict strong coloring of trees
• Strong edge colorings of graphs
• A new kind of graph coloring
• On equitable adjacent strong edge coloring of Mycielski graph of some graphs
• On the Strong Chromatic Number of Graphs

Cites work

• A lower bound on the chromatic number of Mycielski graphs
• A new kind of graph coloring
• A strict strong coloring of trees
• Algorithmic aspects of dominator colorings in graphs
• Chromatic graph theory
• Circular chromatic number and a generalization of the construction of Mycielski.
• Circular chromatic number and Mycielski construction
• Circular chromatic number and Mycielski graphs
• Circular chromatic numbers of Mycielski's graphs
• Dominator colorings and safe clique partitions
• Dominator partitions of graphs
• Edge coloring of bipartite graphs with constraints
• Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 1156681 (Why is no real title available?)
• On a property of the class of n-colorable graphs
• On dominator colorings in graphs
• On graphs having domination number half their order
• On some domination colorings of graphs
• Partial list colorings
• Relations between the lower domination parameters and the chromatic number of a graph.
• Sur le coloriage des graphs
• The circular chromatic number of the Mycielskian ofGdk
• The fractional chromatic number of mycielski's graphs
• Total domination and matching numbers in claw-free graphs
• Total dominator chromatic number of a graph
• Total dominator chromatic number of some operations on a graph
• Total dominator coloring in product graphs
• Total dominator colorings and total domination in graphs
• Vertex colorings with a distance restriction

Cited in

(9)

• On the computational complexity of strong edge coloring
• Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring
• scientific article; zbMATH DE number 6096637 (Why is no real title available?)
• scientific article; zbMATH DE number 5123534 (Why is no real title available?)
• Strongly set-colorable graphs
• Strong k-colourings of graphs
• STRONG COLORINGS OVER PARTITIONS
• A new kind of graph coloring
• A strict strong coloring of trees

This page was built for publication: On strict strong coloring of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5013494)