Vertex-disjoint cycles of length at most four each of which contains a specified vertex
From MaRDI portal
Publication:2725049
DOI10.1002/jgt.1002zbMath0989.05065MaRDI QIDQ2725049
Publication date: 22 July 2002
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.1002
05C38: Paths and cycles
Related Items
The symmetry preserving removal lemma, A 2-factor with short cycles passing through specified independent vertices in graph, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey