Existence of dominating cycles and paths
From MaRDI portal
Cites work
- 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?)
- A note on Hamiltonian circuits
- Graph theory
- Large cycles in graphs
- Note on Hamilton Circuits
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On characterization of Hamiltonian graphs
- Sufficient conditions for a graph to be Hamiltonian
Cited in
(19)- Toughness in graphs -- a survey
- On the dominating (induced) cycles of iterated line graphs
- On computing the Hamiltonian index of graphs
- Domination parameters of the unitary Cayley graph of \(\mathbb{Z}/n \mathbb{Z} \)
- Bibliography on domination in graphs and some basic definitions of domination parameters
- A note on dominating cycles in 2-connected graphs
- Claw-free graphs---a survey
- Circumference of a graph and its distance dominating longest cycles
- Searching for a cycle with maximum coverage in undirected graphs
- Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs
- Degree sums and dominating cycles
- Finding minimum dominating cycles in permutation graphs
- Edge-diameter of a graph and its longest cycles
- Existence of Dlambda-cycles and Dlambda-paths
- Cycles containing many vertices of large degree
- Longest cycles in triangle-free graphs
- Spanning Eulerian subgraphs and matchings
- On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
- Long cycles in graphs with large degree sums
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)
