Small cycles and 2-factor passing through any given vertices in graphs
From MaRDI portal
Publication:711538
DOI10.1007/s12190-009-0333-7zbMath1221.05217MaRDI QIDQ711538
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
05C38: Paths and cycles
Related Items
Degree sum conditions for vertex-disjoint cycles passing through specified vertices, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A 2-factor with short cycles passing through specified independent vertices in graph
- Packing cycles in complete graphs
- Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph
- On Alspach's conjecture with two even cycle lengths
- Vertex-disjoint cycles containing specified edges
- \(k\) disjoint cycles containing specified independent vertices
- A note on 2-factors with two components
- On Hamiltonian bipartite graphs
- On factors of 4-connected claw-free graphs
- Two‐factors each component of which contains a specified vertex
- 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
- Vertex‐disjoint cycles containing prescribed vertices