scientific article; zbMATH DE number 3906530

zbMATH Open0568.05035MaRDI QIDQ3684150FDOQ3684150

Authors: Charles J. Colbourn, Lorna Stewart 

Publication date: 1985

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4095510
• scientific article; zbMATH DE number 3910441
• Finding minimum dominating cycles in permutation graphs
• scientific article; zbMATH DE number 867715
• An optimal algorithm for finding dominating cycles in circular-arc graphs

zbMATH Keywords

algorithmsplit graphdominating cycleD-cycle

Mathematics Subject Classification ID

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

Cited In (18)

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

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3684150)