Vertex disjoint cycles containing specified paths of order 3 in a bipartite graph

MaRDI QIDQ5477449zbMATHFDO

Authors Ryota Matsubara, Hajime Matsumura

Publication date 3 July 2006

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Vertex-disjoint cycles containing specified vertices in a bipartite graph
• Vertex-disjoint cycles containing specified vertices in a bipartite graph
• Disjoint small cycles in graphs and bipartite graphs
• Proof of a conjecture on cycles in a bipartite graph
• Vertex-disjoint cycles containing specified edges in a bipartite graph

Cited in

(9)

• Vertex-disjoint cycles containing specified vertices in a bipartite graph
• Vertex-disjoint cycles containing specified vertices in a bipartite graph
• Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
• scientific article; zbMATH DE number 2188351 (Why is no real title available?)
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• scientific article; zbMATH DE number 2104713 (Why is no real title available?)
• Partitioning a bipartite graph into vertex-disjoint paths.
• Partial degree conditions and cycle coverings in bipartite graphs
• Spanning cycles through specified edges in bipartite graphs

This page was built for publication: Vertex disjoint cycles containing specified paths of order 3 in a bipartite graph

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