Author： Kakimura Naonori Kawarabayashi Ken-Ichi
Publisher： Springer Publishing Company
ISSN： 0209-9683
Source： Combinatorica, Vol.33, Iss.5, 2013-10, pp. : 549-572
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Long cycles through prescribed vertices have the Erdős‐Pósa property
JOURNAL OF GRAPH THEORY, Vol. 87, Iss. 3, 2018-03 ,pp. :
Access to resources
Recommend
Long cycles passing through vertices in k‐connected graphs
JOURNAL OF GRAPH THEORY, Vol. 87, Iss. 3, 2018-03 ,pp. :
Coverings of the Vertices of a Graph by Small Cycles
Graphs and Combinatorics, Vol. 23, Iss. 2, 2007-04 ,pp. :
Packing cycles exactly in polynomial time
By Chen Qin
Journal of Combinatorial Optimization, Vol. 23, Iss. 2, 2012-02 ,pp. :