Existence of dominating cycles and paths

DOI10.1016/0012-365X(83)90165-6zbMath0503.05037MaRDI QIDQ1173098

Henk Jan Veldman

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

forbidden subgraphsdominating cyclesedge degreescontractability

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (19)

Longest cycles in triangle-free graphs ⋮ Claw-free graphs---a survey ⋮ Searching for a cycle with maximum coverage in undirected graphs ⋮ Spanning Eulerian subgraphs and matchings ⋮ A note on dominating cycles in 2-connected graphs ⋮ Edge-diameter of a graph and its longest cycles ⋮ On computing the Hamiltonian index of graphs ⋮ Circumference of a graph and its distance dominating longest cycles ⋮ Degree sums and dominating cycles ⋮ Dominating 2-broadcast in graphs: Complexity, bounds and extremal graphs ⋮ Cycles containing many vertices of large degree ⋮ On Toughness and Hamiltonicity of 2K₂‐Free Graphs ⋮ Toughness in graphs -- a survey ⋮ Long cycles in graphs with large degree sums ⋮ Existence of Dlambda-cycles and Dlambda-paths ⋮ Finding minimum dominating cycles in permutation graphs ⋮ On the dominating (induced) cycles of iterated line 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

Cites Work

• On characterization of Hamiltonian graphs
• Sufficient conditions for a graph to be Hamiltonian
• Large cycles in graphs
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Existence of dominating cycles and paths