The following pages link to On circuits in graphs (Q799690):
Displaying 50 items.
- Vertex-disjoint cycles containing specified vertices in a bipartite graph (Q343781) (← links)
- Hamiltonian cycles with all small even chords (Q409469) (← links)
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Partition of a bipartite graph into cycles (Q686183) (← links)
- Vertex-disjoint quadrilaterals in graphs (Q704291) (← links)
- An Ore-type condition for the existence of two disjoint cycles (Q783683) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Paths and circuits in g-graphs (Q940975) (← links)
- \(K_{1,3}\)-factors in graphs (Q998329) (← links)
- Distributing vertices along a Hamiltonian cycle in Dirac graphs (Q998458) (← links)
- On 2-factors with cycles containing specified edges in a bipartite graph (Q1011783) (← links)
- Partition of a bipartite Hamiltonian graph into two cycles (Q1072572) (← links)
- On non-intersecting Eulerian circuits (Q1090338) (← links)
- Partition of a directed bipartite graph into two directed cycles (Q1126308) (← links)
- Covering the vertices of a digraph by cycles of prescribed length (Q1174160) (← links)
- Graham's problem on shortest networks for points on a circle (Q1186796) (← links)
- Vertex-disjoint claws in graphs (Q1292832) (← links)
- Cycle factors in dense graphs (Q1292839) (← links)
- On a conjecture on directed cycles in a directed bipartite graph (Q1376065) (← links)
- Tutte cycles in circuit graphs (Q1379828) (← links)
- Covering vertices of a graph by \(k\) disjoint cycles (Q1406550) (← links)
- On a tiling conjecture of Komlós for 3-chromatic graphs. (Q1426117) (← links)
- Degree sum conditions on two disjoint cycles in graphs (Q1653021) (← links)
- Covering and tiling hypergraphs with tight cycles (Q1689974) (← 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)
- Almost-spanning subgraphs with bounded degree in dense graphs (Q1864574) (← links)
- 2-factors in dense graphs (Q1917480) (← links)
- On the circuit diameter conjecture (Q1991340) (← links)
- Tutte paths and long cycles in circuit graphs (Q2099420) (← links)
- Disjoint cycles with partial degree conditions in claw-free graphs (Q2099484) (← links)
- Tilings in vertex ordered graphs (Q2131863) (← links)
- Disjoint directed cycles in directed graphs (Q2185930) (← links)
- Disjoint cycles in graphs with distance degree sum conditions (Q2400552) (← links)
- Disjoint long cycles in a graph (Q2441136) (← links)
- \(k\) disjoint cycles containing specified independent vertices (Q2519840) (← links)
- Bounding the number of circuits of a graph (Q2563510) (← links)
- Disjoint directed cycles with specified lengths in directed bipartite graphs (Q2659188) (← links)
- A greedy algorithm for the social golfer and the Oberwolfach problem (Q2670589) (← links)
- On Degree Sequences Forcing The Square of a Hamilton Cycle (Q2968516) (← links)
- An asymptotic version of a conjecture by Enomoto and Ota (Q3055903) (← links)
- Distributing vertices on Hamiltonian cycles (Q3113278) (← links)
- (Q3449055) (← links)
- (Q3781129) (← links)
- (Q3816110) (← links)
- (Q3990753) (← links)
- Proof of a tiling conjecture of Komlós (Q4434471) (← links)
- Partitions of a graph into paths with prescribed endvertices and lengths (Q4489491) (← links)
- <i>K</i><sub>4</sub><sup>−</sup>‐factor in a graph (Q4534211) (← links)
