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

zbMATH Open1100.05051MaRDI QIDQ5477449FDOQ5477449

Authors: Ryota Matsubara, Hajime Matsumura 

Publication date: 3 July 2006

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

Mathematics Subject Classification ID

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

Cited In (8)

• Partial degree conditions and cycle coverings in bipartite graphs
• Partitioning a bipartite graph into vertex-disjoint paths.
• Spanning cycles through specified edges in bipartite graphs
• Vertex-disjoint cycles containing specified vertices in a bipartite graph
• Title not available (Why is that?)
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Vertex-disjoint cycles containing specified vertices in a bipartite graph
• Title not available (Why is that?)

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)