Existence of dominating cycles and paths
From MaRDI portal
Cites work
- A note on Hamiltonian circuits
- Graph theory
- scientific article; zbMATH DE number 3730183 (Why is no real title available?)
- scientific article; zbMATH DE number 3630799 (Why is no real title available?)
- scientific article; zbMATH DE number 3353327 (Why is no real title available?)
- Large cycles in graphs
- Note on Hamilton Circuits
- On characterization of Hamiltonian graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Sufficient conditions for a graph to be Hamiltonian
Cited in
(21)- Existence of Dlambda-cycles and Dlambda-paths
- Finding minimum dominating cycles in permutation graphs
- Longest cycles in triangle-free graphs
- Spanning Eulerian subgraphs and matchings
- Cycles containing many vertices of large degree
- Claw-free graphs---a survey
- A note on dominating cycles in 2-connected graphs
- On the dominating (induced) cycles of iterated line graphs
- Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \)
- Circumference of a graph and its distance dominating longest cycles
- Degree sums and dominating cycles
- Toughness in graphs -- a survey
- On computing the Hamiltonian index of graphs
- Searching for a cycle with maximum coverage in undirected graphs
- Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
- On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
- Edge-diameter of a graph and its longest cycles
- Fine-grained complexity of multiple domination and dominating patterns in sparse graphs
- Fine-grained classification of detecting dominating patterns
- Long cycles in graphs with large degree sums
- Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication: Existence of dominating cycles and paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173098)
