Taiwanese Journal of Mathematics, Vol. 13, No. 5 (October 2009), pp. 1397-1410 (14 pages) Let G be a simple undirected graph. Denote by mi(G) (respectively, xi(G)) the number of maximal (respectively, ...
The Erdős–Pósa property forms a pivotal concept in modern graph theory by establishing a profound duality between the problems of packing and covering cycles or other substructures. At its core, this ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback