Large vertex-disjoint cycles in a bipartite graph
From MaRDI portal
Publication:1586586
DOI10.1007/S003730070017zbMATH Open0963.05079OpenAlexW2091699090MaRDI QIDQ1586586FDOQ1586586
Authors: Hong Wang 
Publication date: 28 June 2001
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730070017
Recommendations
- scientific article; zbMATH DE number 3875321
- Long cycles in bipartite graphs
- Graphs with many vertex-disjoint cycles
- Disjoint small cycles in graphs and bipartite graphs
- Vertex-disjoint double chorded cycles in bipartite graphs
- Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
- Vertex-disjoint cycles containing specified vertices in a bipartite graph
- Vertex-disjoint cycles containing specified vertices in a bipartite graph
- Vertex-disjoint cycles containing specified edges in a bipartite graph
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
Cited In (15)
- Partition of a bipartite graph into cycles
- Packing disjoint cycles over vertex cuts
- On independent cycles in a bipartite graph
- Degree conditions for bipartite graphs to contain 6-cycles
- Title not available (Why is that?)
- Maximal total length of \(k\) disjoint cycles in bitpartite graphs
- Title not available (Why is that?)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- TILING DIRECTED GRAPHS WITH TOURNAMENTS
- On Enomoto's problems in a bipartite graph
- Vertex-disjoint quadrilaterals in bipartite graphs
- Cycles of Given Size in a Dense Graph
- Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree
- A Note on Vertex-Disjoint Cycles
- Vertex-disjoint hexagons with chords in a bipartite graph
This page was built for publication: Large vertex-disjoint cycles in a bipartite graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586586)
