Cites work
- A remark on two sufficient conditions for Hamilton cycles
- Circuits containing specified edges
- Cycles through specified vertices of a graph
- Hamilton connected graphs
- Hamilton cycles in regular 2-connected graphs
- scientific article; zbMATH DE number 3668667 (Why is no real title available?)
- scientific article; zbMATH DE number 3722690 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3494318 (Why is no real title available?)
- scientific article; zbMATH DE number 3627227 (Why is no real title available?)
- In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
- The binding number of a graph and its Anderson number
Cited in
(29)- Hamiltonian cycles and dominating cycles passing through a linear forest
- A look at cycles containing specified elements of a graph
- A Chvátal-Erdős condition for (1,1)-factors in digraphs
- Any four independent edges of a 4-connected graph are contained in a circuit
- On circuits through five edges
- Cycles through a prescribed vertex set in \(n\)-connected graphs.
- Long cycles through a linear forest
- A generalization of a theorem of Dirac
- One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
- Color neighborhood union conditions for proper edge-pancyclicity of edge-colored complete graphs
- Rooted topological minors on four vertices
- Cycle traversability for claw-free graphs and polyhedral maps
- Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey
- A degree sum condition for long cycles passing through a linear forest
- Cycle double covers and spanning minors. I
- An Improved Algorithm for Finding Cycles Through Elements
- Extensions to 2-factors in bipartite graphs
- Cycles through five edges in 3-connected cubic graphs
- A degree condition for cycles passing through specified vertices and edges
- On edge colorings of graphs with no color-rich cycles
- Cycles through two edges in signed graphs (extended abstract)
- Hamilton cycles in tough (2P₂ P₁)-free graphs
- (Almost-)optimal FPT algorithm and kernel for T-cycle on planar graphs
- Cycles through four edges in 3-connected cubic graphs
- Paths and cycles concerning independence edges
- Girth in graphs
- A Chvátal-Erdős condition for (t,t)-factors in digraphs using given arcs
- On a cycle through a specified linear forest of a graph
- The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
This page was built for publication: Circuits through specified edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1165869)
