Article ID Journal Published Year Pages File Type
4647799 Discrete Mathematics 2013 14 Pages PDF
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
Preview
A strong Pósa Condition for a graphic list to be forcibly Z3-connected
Authors
, ,