Small cycles and 2-factor passing through any given vertices in graphs
From MaRDI portal
Publication:711538
DOI10.1007/S12190-009-0333-7zbMATH Open1221.05217OpenAlexW1990842082MaRDI QIDQ711538FDOQ711538
Authors: Jiuying Dong 
Publication date: 26 October 2010
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-009-0333-7
Recommendations
- A 2-factor with short cycles passing through specified independent vertices in graph
- scientific article; zbMATH DE number 1926044
- Disjoint cycles and \(2\)-factors with Fan-type condition in a graph
- \(k\) disjoint cycles containing specified independent vertices
- Degree sum conditions for vertex-disjoint cycles passing through specified vertices
Cites Work
- Packing cycles in complete graphs
- On Hamiltonian bipartite graphs
- Title not available (Why is that?)
- Vertex-disjoint cycles containing specified edges
- Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph
- Vertex‐disjoint cycles containing prescribed vertices
- A note on 2-factors with two components
- On factors of 4-connected claw-free graphs
- Two‐factors each component of which contains a specified vertex
- On Alspach's conjecture with two even cycle lengths
- \(k\) disjoint cycles containing specified independent vertices
- A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition
- Vertex-disjoint cycles containing specified vertices in a bipartite graph
- Title not available (Why is that?)
- On 2-factors with quadrilaterals containing specified vertices in a bipartite graph.
- A 2-factor with short cycles passing through specified independent vertices in graph
Cited In (4)
This page was built for publication: Small cycles and 2-factor passing through any given vertices in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711538)
