If such an M exists, for a graph G, then G is called an Open Distance Pattern Colorable (odpc) graph. The minimum cardinality of an odp coloring set in G, if it exists, is called the odpc-number of G ...
Department of Mathematical Sciences, Shahid Beheshti University, P.O. Box 19839-63113, Tehran, Iran ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results