Lai's Conditions for Spanning and Dominating Closed Trails

[摘要] A graph is supereulerian if it has a spanning closed trail. For an integer $r$, let ${\cal Q}_0(r)$ be  the family of 3-edge-connected nonsupereulerian graphs of order at most $r$. For a graph $G$, define $\delta_L(G)=\min\{\max\{d(u), d(v) \}| \  \mbox{

[学科分类] 离散数学和组合数学

[关键词] Spanning and dominating closed trails;Hamiltonian line graphs;Collapsible graphs