Dominated coloring in certain trees
From MaRDI portal
Cites work
- Antimagic orientations for the complete \(k\)-ary trees
- Application of soft sets to graph coloring
- Christmas tree: a versatile 1-fault-tolerant design for token rings
- Dominated and dominator colorings over (edge) corona and hierarchical products
- Dominated coloring in product graphs
- Dominated colorings of graphs
- Domination landscape in evolutionary algorithms and its applications
- Domination parameters in hypertrees and sibling trees
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- On b-acyclic chromatic number of a graph
- On dominated coloring of graphs and some Nordhaus-Gaddum-type relations
- Perfect Italian domination on some generalizations of cographs
- Roman domination problem with uncertain positioning and deployment costs
- The 2-domination number of cylindrical graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- The domination number of the king's graph
- The exact domination number of generalized Petersen graphs \(P(n,k)\) with \(n=2k\) and \(n=2k+2^\ast\)
- Transversals of subtree hypergraphs and the source location problem in digraphs
- Uncertain vertex coloring problem
This page was built for publication: Dominated coloring in certain trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6953691)