Vertex-disjoint 4-cycles containing specified edges in a bipartite graph

DOI10.1016/J.DISC.2005.03.011zbMath1070.05055OpenAlexW2055380880MaRDI QIDQ2566145

Hajime Matsumura

Publication date: 22 September 2005

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.03.011

zbMATH Keywords

PackingShort cycle

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (7)

Vertex-disjoint cycles containing specified vertices in a bipartite graph ⋮ 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 ⋮ \(k\) disjoint cycles containing specified independent vertices ⋮ Bi-cycle extendable through a given set in balanced bipartite graphs ⋮ On 2-factors with cycles containing specified vertices in a bipartite graph ⋮ A look at cycles containing specified elements of a graph

Cites Work

• On the maximal number of independent triangles in graphs
• On the maximum number of independent cycles in a bipartite graph
• Vertex-disjoint cycles containing specified edges
• Proof of a conjecture on cycles in a bipartite graph
• Unnamed Item

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