Abstract
We prove that a forest is cordial if and only if it does not have 4k+2 components and every vertex has odd-degree.
小提示:本篇文献需要登录阅读全文,点击跳转登录
Kastrati, F; Myrvold, W; Panjer, LD; Williams, A
Williams, A (通讯作者),Williams Coll, Williamstown, MA USA.
FUNDAMENTALS OF COMPUTATION THEORY, FCT 2023, 2023; 14292 (): 291