Proof of a conjecture on cycles in a bipartite graph
From MaRDI portal
Publication:4261189
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199908)31:4<333::AID-JGT8>3.0.CO;2-4" /><333::AID-JGT8>3.0.CO;2-4 10.1002/(SICI)1097-0118(199908)31:4<333::AID-JGT8>3.0.CO;2-4zbMath0957.05066OpenAlexW4249337121MaRDI QIDQ4261189
Publication date: 15 March 2001
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199908)31:4<333::aid-jgt8>3.0.co;2-4
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 ⋮ Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph ⋮ On 2-factors with prescribed properties in a bipartite graph ⋮ On 2-factors with cycles containing specified edges in a bipartite graph ⋮ On Enomoto's problems in a bipartite graph ⋮ Vertex-disjoint 4-cycles containing specified edges in a bipartite graph
Cites Work
This page was built for publication: Proof of a conjecture on cycles in a bipartite graph
