Vertex-disjoint short cycles containing specified edges in a graph

zbMATH Open1224.05263MaRDI QIDQ3428673FDOQ3428673

Authors: Hajime Matsumura 

Publication date: 29 March 2007

Recommendations

• Vertex-disjoint cycles of length at most four each of which contains a specified vertex
• Vertex-disjoint cycles containing specified edges
• Disjoint 5-cycles in a graph
• Short disjoint cycles in graphs with degree constraints
• scientific article; zbMATH DE number 5914863

zbMATH Keywords

packingshort cyclesminimum degree conditionvertex-disjoint cyclesspecified edges

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited In (4)

• Vertex-disjoint cycles of length at most four each of which contains a specified vertex
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Edge disjoint cycles through specified vertices
• On short cycles through prescribed vertices of a polyhedral graph

This page was built for publication: Vertex-disjoint short cycles containing specified edges in a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3428673)