Abstract. In 2008, Alspach [The Wonderful Walecki Construction, Bull. Inst. Combin. Appl. 52 (2008) 7–20] defined the matching sequencibility of a graph 𝐺 to be the largest integer 𝑘 such that there ...
You can use a special group of functions and CALL routines to match or change data according to a specific pattern that you specify. By using these functions and CALL routines, you can determine ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback