Vertex-disjoint cycles of length at most four each of which contains a specified vertex

DOI10.1002/jgt.1002zbMath0989.05065OpenAlexW4252203609MaRDI QIDQ2725049

Yoshiyasu Ishigami

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

zbMATH Keywords

degreevertex-disjoint cyclesquadrilateral

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (3)

Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ A 2-factor with short cycles passing through specified independent vertices in graph ⋮ The symmetry preserving removal lemma

This page was built for publication: Vertex-disjoint cycles of length at most four each of which contains a specified vertex