Pages that link to "Item:Q1301840"
From MaRDI portal
The following pages link to On the maximum number of independent cycles in a graph (Q1301840):
Displayed 15 items.
- On a sharp degree sum condition for disjoint chorded cycles in graphs (Q604663) (← links)
- Graph partition into \(K_{3}\)s and \(K_{4}\)s (Q711522) (← links)
- Used car salesman problem: a differential auction-barter market (Q812388) (← links)
- Independence number and vertex-disjoint cycles (Q878646) (← links)
- A 2-factor with short cycles passing through specified independent vertices in graph (Q937249) (← links)
- Covering the vertices of a graph with cycles of bounded length (Q1025448) (← links)
- Ore-type conditions implying 2-factors consisting of short cycles (Q1044946) (← links)
- Covering vertices of a graph by \(k\) disjoint cycles (Q1406550) (← links)
- Triangles in claw-free graphs (Q1584304) (← links)
- 2-factors in dense graphs (Q1917480) (← links)
- An Ore-type analogue of the Sauer-Spencer theorem (Q2385133) (← links)
- On the number of independent chorded cycles in a graph (Q2519839) (← links)
- Existence of two disjoint long cycles in graphs (Q2581410) (← links)
- Recent Results on Disjoint Cycles in Graphs (Q3439373) (← links)
- Disjoint triangles and quadrilaterals in a graph (Q5900539) (← links)