Pages that link to "Item:Q1406550"
From MaRDI portal
The following pages link to Covering vertices of a graph by \(k\) disjoint cycles (Q1406550):
Displaying 13 items.
- A 2-factor with short cycles passing through specified independent vertices in graph (Q937249) (← links)
- Packing disjoint cycles over vertex cuts (Q973127) (← links)
- Covering the vertices of a graph with cycles of bounded length (Q1025448) (← links)
- Fan-type condition on disjoint cycles in a graph (Q1699571) (← links)
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
- Covering a graph with cycles of length at least 4 (Q1753038) (← links)
- Covering vertices by a specified number of disjoint cycles, edges and isolated vertices (Q1928447) (← links)
- \(k\) disjoint cycles containing specified independent vertices (Q2519840) (← links)
- Covering a subset with two cycles (Q2820191) (← links)
- Cycles of Given Size in a Dense Graph (Q3455245) (← links)
- Covering vertices by cycles (Q4317218) (← links)
- On DRC‐covering of K<sub>n</sub> by cycles (Q4800406) (← links)
- Filtered matchings and simplicial complexes (Q5080926) (← links)