Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647799 | Discrete Mathematics | 2013 | 14 Pages |
Abstract
Let Ï be a graphic list (d1,â¦,dn), where nâ¥3 and d1â¤â¯â¤dn. If each realization of Ï is Z3-connected, then Ï is said to be forcibly Z3-connected. If dmâ¥m+1 for 1â¤m
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yue Zhang, Jian-Hua Yin,