The following pages link to Circuits through specified edges (Q1165869):
Displayed 20 items.
- Cycles through five edges in 3-connected cubic graphs (Q581414) (← links)
- Cycles through four edges in 3-connected cubic graphs (Q753835) (← links)
- Paths and cycles concerning independence edges (Q757417) (← links)
- Girth in graphs (Q792338) (← links)
- A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs (Q803164) (← links)
- On a cycle through a specified linear forest of a graph (Q868359) (← links)
- The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index (Q982614) (← links)
- Hamiltonian cycles and dominating cycles passing through a linear forest (Q1024474) (← links)
- A look at cycles containing specified elements of a graph (Q1045026) (← links)
- A Chvátal-Erdős condition for (1,1)-factors in digraphs (Q1071779) (← links)
- Any four independent edges of a 4-connected graph are contained in a circuit (Q1073040) (← links)
- On circuits through five edges (Q1126199) (← links)
- Cycles through a prescribed vertex set in \(n\)-connected graphs. (Q1426102) (← links)
- Long cycles through a linear forest (Q1850534) (← links)
- A generalization of a theorem of Dirac (Q1850552) (← links)
- One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture (Q1850574) (← links)
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey (Q2277468) (← links)
- A degree sum condition for long cycles passing through a linear forest (Q2427497) (← links)
- Cycle double covers and spanning minors. I (Q2490249) (← links)
- An Improved Algorithm for Finding Cycles Through Elements (Q3503860) (← links)