scientific article

zbMath0568.05035MaRDI QIDQ3684150

Charles J. Colbourn, Lorna K. Stewart

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmsplit graphdominating cycleD-cycle

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (16)

A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs ⋮ The complexity of recognizing tough cubic graphs ⋮ On strictly chordality-\(k\) graphs ⋮ A lower bound on the Hamiltonian path completion number of a line graph ⋮ \(H\)-domination in graphs ⋮ Dominating sets in perfect graphs ⋮ Dominating cycles in Halin graphs ⋮ An optimal algorithm for finding dominating cycles in circular-arc graphs ⋮ Toughness in graphs -- a survey ⋮ A note on the Hamiltonian circuit problem on directed path graphs ⋮ Jump number maximization for proper interval graphs and series-parallel graphs ⋮ Unnamed Item ⋮ Revising Johnson's table for the 21st century ⋮ Finding minimum dominating cycles in permutation graphs ⋮ Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

This page was built for publication: