|
|||||
|
|
An upper bound on the path number of a digraph |
|
| Authors: | Richard C O&#x;Brien |
| Institution: | Department of Mathematics, Queen''s University, Kingston, Ontario, Canada |
| Abstract: | A proof is presented of the conjecture of Alspach and Pullman that for any digraph G on n ≥ 4 vertices, the path number of G is at most ]. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |