\(k\) disjoint cycles containing specified independent vertices
From MaRDI portal
Publication:2519840
DOI10.1016/j.disc.2007.09.028zbMath1172.05030OpenAlexW2072200478MaRDI QIDQ2519840
Publication date: 27 January 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.09.028
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- On circuits in graphs
- An extension of a theorem on cycles containing specified independent edges
- Covering vertices of a graph by \(k\) disjoint cycles
- Vertex-disjoint cycles containing specified edges
- Vertex-disjoint 4-cycles containing specified edges in a bipartite graph
- A note on 2-factors with two components
- Existence of two disjoint long cycles in graphs
- Degree conditions for 2-factors
- Covering a graph with cycles passing through given edges
- A 2‐factor with two components of a graph satisfying the Chvátal‐Erdös condition
- On the maximal number of independent circuits in a graph
This page was built for publication: \(k\) disjoint cycles containing specified independent vertices