Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph
From MaRDI portal
Publication:949291
DOI10.1007/s12190-008-0050-7zbMath1176.05043OpenAlexW2039785910MaRDI QIDQ949291
Publication date: 21 October 2008
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-008-0050-7
Related Items (2)
Vertex-disjoint cycles containing specified vertices in a bipartite graph ⋮ Small cycles and 2-factor passing through any given vertices in graphs
Cites Work
- Unnamed Item
- Edge covering coloring of nearly bipartite graphs
- On 2-factors containing 1-factors in bipartite graphs
- On quadrilaterals in a graph
- On the bipartite case of El-Zahár's conjecture
- On oriented 2-factorable 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
- Degree conditions for 2-factors
- On the maximal number of independent circuits in a graph
This page was built for publication: Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph
