DISJOINT CYCLES WITH PRESCRIBED LENGTHS AND INDEPENDENT EDGES IN GRAPHS

DOI10.4134/JKMS.2014.51.5.919zbMath1298.05179OpenAlexW2031037113MaRDI QIDQ3191130

Hong Wang

Publication date: 24 September 2014

Published in: Journal of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL: http://www.mathnet.or.kr/mathnet/kms_content.php?no=412183

zbMATH Keywords

cyclesdisjoint cyclescycle coverings

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Related Items (1)

Degree conditions for the existence of vertex-disjoint cycles and paths: a survey

This page was built for publication: DISJOINT CYCLES WITH PRESCRIBED LENGTHS AND INDEPENDENT EDGES IN GRAPHS